Become a fan of Slashdot on Facebook


Forgot your password?
Slashdot Deals: Deal of the Day - Pay What You Want for the Learn to Code Bundle, includes AngularJS, Python, HTML5, Ruby, and more. ×

Submission + - Pentago is a first player win (

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 was created for logged-in users only, but now has been archived. No new comments can be posted.

Pentago is a first player win

Comments Filter:

I have a theory that it's impossible to prove anything, but I can't prove it.