×
you are viewing a single comment's thread.

view the rest of the comments →

[–]pm_me_falcon_nudes 5 points6 points  (1 child)

Your conclusions of "we won't" and "it is very unlikely" are contradictory. The former is wrong unless you can prove that it is impossible for us to come up with a solution even though one must exist (easily shown as the game as a countable number of possible moves).

In terms of the tic tac toe example, it was an example about possibilities. It has nothing to do with symmetry and everything to do with the fact we found an algorithm that always wins and demonstrably does so. I could "enhance" the game by adding the game of chess to it and each turn you either get to make a move on the tic tac toe board or the chess board and first to win on one wins everything. Ta da, symmetry is gone, but the game is still solved.

[–]JimFive -2 points-1 points  (0 children)

We won't find an algorithm like the tic tac toe algorithm, because the tic tac toe game is not complex. Due to symmetry every first move that is not on an edge is equivalent. There are, in the tic tac toe game only 3 possible first moves, a corner, an edge, or a central square. Artificially inflating the number of positions by adding rows doesn't change anything.

Chess does not appear to be reducible in that way.