Scholar's mate Bibliography Scholar's mate In chess, Scholar's Mate is the checkmate achieved by the following moves, or similar: The same mating pattern may be reached by various move orders. For example, White might play 2.Qh5, or Black might play 2...Bc5. In all variations, the basic idea is the same: the queen and bishop combine in a simple mating attack on f7 (or f2 if Black is performing the mate). Scholar's Mate is sometimes referred to as the "Four-Move Checkmate", although there are other ways to checkmate in four moves. Unlike Fool's Mate, which rarely occurs at any level, games ending in
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,