Beirut Chess any turn, instead of moving, a player may say "Boom!" and overturn their bomb carrier. All pieces of either color on squares adjacent to the bomb carrier are removed from the game, as well as the bomb carrier itself. There are two ways to win: A captured piece may not be inspected to see whether or not it was a bomb carrier. Bibliography Beirut Chess Beirut Chess is a chess variant invented by Jim Winslow in 1992. The game is played using the standard chess pieces and board, with each side having secretly equipped one of their with a "bomb"—which
Chess and is provably less than 10, with a game-tree complexity of approximately 10. The game-tree complexity of chess was first calculated by Claude Shannon as 10, a number known as the Shannon number. Typically an average position has thirty to forty possible moves, but there may be as few as zero (in the case of checkmate or stalemate) or (in a constructed position) as many as 218. Chess has inspired many combinatorial puzzles, such as the knight's tour and the eight queens puzzle. The idea of creating a chess-playing machine dates to the 18th century; around 1769, the chess-playing automaton