Target "crumbs":

Plays "eat the breadcrumbs" on an 8x8 torus grid.
Each cell has a crumb or not.
Goal is to eat all crumbs in shortest number of moves.

X axis goes across, Y axis goes down, (0,0) is in top left corner.
You start at (0,0) pointing right.
Four moves are possible:
	0: advance one cell in the direction you are pointing,
		and eat a crumb if it is there.
	1: turn 90 degress left (anticlockwise)
	2: turn 90 degress right (clockwise)
	3: do nothing
You have five binary eyes, which either see a crumb or not:
	0: looking at the cell to the left
	1: looking at the cell ahead & to the left
	2: looking at the cell directly ahead
	3: looking at the cell ahead & to the right
	4: looking at the cell to the right

Currently the evolved program is rerun for each individual move,
with the contents of the five eyes in the Lithium Global variables
a, b, c, d, & e.   It has no memory of past moves.   The first
byte the program outputs is the move to make (modulo 4).


TO RUN

	 tclsh run.tcl  crumbs   -p200 -e1

		You may use /li or /lp or /bf