Pentago Is a First-Player Win
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."
Out of curiousity, does anybody know what the number for chess that compares to the 3e15 number for pentago is? In other words, how much "bigger" is chess?
After playing in chess tournaments for 20 years, I have strongly solved that chess is a forced win for any player facing me.
No, tic-tac-toe is always a tie.
"[Regarding the 'cloud,'] ownership was what made America different than Russia." -- Woz
Can't the editors write a headline that meets the basic rules of grammar? How about "In the game of Pentago the first player can always win", or "Pentago is strongly solved".
No cause with out those grammar mistakes their would be 30 pricent fuer com-mints on /.
It all starts at 0
If Matthew Broderick had played pentago, the computer would have concluded the first country launching a nuclear missile always wins the war.
Il came close
No, now that Pentago is solved, we're reduced to online games of Pedant.
HINT: Last player always wins.
Plus, where would you put the chess board?
You shall see a cow on the roof of a cotton house.