Forgot your password?
typodupeerror
Supercomputing Classic Games (Games)

Pentago Is a First-Player Win 136

Posted by timothy
from the heads-I-win-tails-you-lose dept.
First time accepted submitter jwpeterson writes "Like chess and go, pentago is a two player, deterministic, perfect knowledge, zero sum game: there is no random or hidden state, and the goal of the two players is to make the other player lose (or at least tie). Unlike chess and go, pentago is small enough for a computer to play perfectly: with symmetries removed, there are a mere 3,009,081,623,421,558 (3e15) possible positions. Thus, with the help of several hours on 98304 threads of Edison, a Cray supercomputer at NERSC, pentago is now strongly solved. 'Strongly' means that perfect play is efficiently computable for any position. For example, the first player wins."
This discussion has been archived. No new comments can be posted.

Pentago Is a First-Player Win

Comments Filter:

"Out of register space (ugh)" -- vi

Working...