[Gvr-devel] Request for an algorithm

[Nicolas F. <nic...@fr...>]

Hi.

As you all know, there are a lot of different versions of Karel. You
may allready know the Jave course given at Standford School
(http://see.stanford.edu/see/courseinfo.aspx?coll=824a47e1-135f-4508-a5aa-866adcae1111)

The first assignment asks the students to solve several exercises. One
of them puzzled me :

Guido is in a world like this :

Robot 1 1 E 50
Wall 1 10 N 15
Wall 15 1 E 10

What needs to be done is put a single beeper at the center
intersection (or one of the two center intersections if the word has
even width), and stop there. You can use any number of extra beepers to
accomplish this, but there should be only one beeper in the world at
the end.

What I was thinking about : put a beeper at each end of the first line,
and then move them towards each other alternatively until they are on
the same intersection or adjacent intersections.

What I lack is a definite Guido program to accomplish this.

Could someone help me ?

Thanks.

\bye

-- 

Nicolas FRANCOIS                      |  /\ 
http://nicolas.francois.free.fr       | |__|
				      X--/\\
We are the Micro$oft.		        _\_V
Resistance is futile.		    
You will be assimilated.         darthvader penguin