|
Minichess is a family of chess variants played with regular chess pieces and standard rules, but on a smaller board.〔 〕 The motivation for these variants is to make the game simpler and shorter than the standard chess. The first chess-like game implemented on a computer was a 6×6 chess variant Los Alamos chess. The low memory capacity of the early days computer required reduced board size and smaller number of pieces to make the game implementable on a computer. == 3×3 and 3×4 boards == Chess on a 3×3 board does not have any clearly defined starting position. However, it is a solved game: the outcome of every possible position is known. The best move for each side is known as well. The game was solved independently by Aloril in 2001 and by Kirill Kryukov in 2004. The solution by Kryukov is more complete, since it allows pawns to be placed everywhere, not only on second row as by Aloril. The longest checkmate on 3×3 board takes 16 moves. The number of legal positions is 304,545,552.〔(3×3 Chess ) by Kirill Kryukov.〕 In 2009 Kryukov reported solving 3×4 chess.〔(3×4 Chess ) by Kirill Kryukov.〕 On this board there are 167,303,246,916 legal positions and the longest checkmate takes 43 moves. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Minichess」の詳細全文を読む スポンサード リンク
|