Back to photostream

2D8×14T2SS48NS2PC

2D8×14T2SS48NS2PC

 

Solving a game means providing a perfect play algorithm from any position, i.e. finding an optimal strategy by which one player can always force a victory or all players can force a draw. No complete solution for 2D8x8S2SS32S2PC is currently known. There is disagreement on whether the current exponential growth of computing power will continue long enough to someday allow for solving it by brute force, i.e. by checking all possibilities.

 

In singles' MPC each player can attack any of the others and vice versa. Once a player is checkmated, the checkmated player can 1) remove at once all their remaining pieces from the board, 2) have their pieces taken one by one by other players, or 3) have their remaining pieces used by the checkmating player during that player's turn. After several temporary and non-exclusively-mutual collusions, play eventually converges into conventional 2P game, until only one uncheckmated player remains.

 

FEN₀ [●, b¹ ² ³; ○, w ; A = Q + N; a = q + n]:

 

2D-8×8S/C-2-S-S-32S-2P-C: rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR w KQkq - 0 1

2D-8×14T-2-S-S-48NS-2P-C: 8/8/pppppppp/rnbakbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBAKBNR/PPPPPPPP/8/8 w KAka - 0 1

 

100% = 112 , □↔□ 1 P

 

REFERENCES

 

D. Silver & al. 2018: AZ masters chess, shogi & Go by selfplay.

D. Silver & al. 2017: Mastering chess by selfplay with GRLA.

I. Zaragatski 2014: Men, women and chess skill.

M. Bilalić & al. 2009: Why women are so good at chess.

G. Kasparov & M. Greengard 2007: How life imitates chess.

D. Levy 1988: Computer chess compendium.

 

AZT4PNSCChess æstheticsen.lichess.org

9,117 views
1 fave
0 comments
Uploaded on July 17, 2015
Taken on December 24, 2015