Fool's mate king at f8 with 6...Bg7 would have prolonged the game. White still wins with 7.Qf5! Nf6 8.Bh6 Bxh6 9.gxh7 Bxh1 (9...e6 opens another flight square at e7; then White checks with 10.Qg6+ Ke7) 10.Qg6+ Kf8 11.Qxh6+ Kf7 12.Nh3, but much slower than in the game. Fool's mate In chess, Fool's Mate, also known as the Two-Move Checkmate, is the checkmate in the fewest possible number of moves from the start of the game. This can be achieved only by Black, who can deliver checkmate on move 2 with the queen. Fool's Mate received its name because it can only occur
First-move advantage in chess greater (e.g., a player receiving two whites and four blacks). The game of chess is not solved, meaning it has not been determined with certainty whether a perfectly played game would end in a win for White, a draw, or even a win for Black. Due to its high level of complexity and the limitations of computer technology it is considered unlikely that it will be solved in the foreseeable future. In his 1950 paper "Programming a Computer for Playing Chess", information theorist Claude Shannon argued that in principle the game of chess ought to be solvable. In practical terms,