Xref: utzoo rec.puzzles:6545 alt.sources.wanted:510 comp.ai:7497 comp.lang.prolog:3127 comp.lang.c:31494
Path: utzoo!mnetor!geac!torsqnt!news-server.csri.toronto.edu!cs.utexas.edu!samsung!usc!apple!snorkelwacker!bloom-beacon!eru!hagbard!sunic!mcsun!hp4nl!maestro.htsa.aha.nl!maestro!jand
From: jand@maestro.htsa.aha.nl (Andre v.d. Vlies)
Newsgroups: rec.puzzles,alt.sources.wanted,comp.ai,comp.lang.prolog,comp.lang.c
Subject: solution Yogo/Solitaire wanted.
Keywords: yogo solitaire puzzle
Message-ID: <2345@maestro.htsa.aha.nl>
Date: 31 Aug 90 10:40:49 GMT
Sender: uucp@maestro.htsa.aha.nl
Followup-To: rec.puzzles
Organization: AHA-TMF (Technical Institute), Amsterdam, The Netherlands
Lines: 22


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 !