Re: puzzle challenge for Survival

[John Williams <williams@morinda.com>]

Been there, done that.  First player wins on all non-trivial opening
moves.

It's pretty easy with an exhaustive search, since the tree is
depth-limited, and very narrow.

~ John Williams



On Tue, 26 Feb 2002, Douglas Zander wrote:

> Yes, I think that Ohs has a big advantage in this game.   And yes, I am
> thinking of solving this game.  So far I believe I would need 40 bits
> of data for each board (5 bytes) and since there is rotation to take
> into consideration, there are not that many boards.  I really think this
> game could be solved and I suspect that it would be a win for first player.
> :-(
>
> --
>  Douglas Zander
>  Milwaukee, WI, USA
>
>
>
> To unsubscribe, send a message to esquire@gamerz.net with
> 	unsubscribe pbmserv-users
> as the BODY of the message.  The SUBJECT is ignored.
>