[alt.sources.wanted] solution Yogo/Solitaire wanted.

jand@maestro.htsa.aha.nl (Andre v.d. Vlies) (08/31/90)

I'm sure there have been many attempts to write a program that gives you
all the answers to the YOGO/SOLITAIRE puzzle.
The puzzle I mean consists of 33 holes (.) and 32 pins (*), with one pin
left out in the middle. Object of the game is to take away 31 pegs by 
'striking (?)' them like in the checkers game, and leave one peg in the
middle.

so   p p p    becomes  . . .      after 31 moves.
     p p p             . . .
 p p p p p p p     . . . . . . .
 p p p . p p p     . . . p . . .
 p p p p p p p     . . . . . . .
     p p p             . . .
     p p p             . . .

Solutions in Prolog, C or Pascal are preferred. Please include explanation
of any non-brute-force algorithmes used.

Discussions in rec.puzzles please ?

Thanks !