to 69 moves, and (4) four knights win against a queen (85 moves). This was proved by computer in 2005 and was the first ending with seven pieces that was completely solved. (See endgame tablebase.) General remarks on these endings Many of these endings are listed as a win in a certain number of moves. That assumes perfect play by both sides, which is rarely achieved if the number of moves is large. Also, finding the right moves may be exceedingly difficult for one or both sides. When a forced win is more than fifty moves long, some positions can be won within the fifty move limit (for a draw claim) and others cannot. Also, generally all of the combinations of pieces that are usually a theoretical draw have some non-trivial positions that are a win for one side. Similarly, combinations that are generally a win for one side often have non-trivial positions which result in draws. Tables This a table listing several pawnless endings, the number of moves in the longest win, and the winning percentage for the first player. The winning percentage can be misleading – it is the percentage of wins out of all possible positions, even if a piece can immediately be captured or won by a skewer, pin, or fork. The largest number of moves to a win is the number of moves until either checkmate or transformation to a simpler position due to winning a piece. Also, the fifty-move rule is not taken into account. Many of the combinations listed involve single piece capture and transposition into six-piece territory almost immediately from the starting position. References Bibliography Further reading Pawnless endings are discussed on pages 87–96. Pawnless endings are discussed on pages 9–22. Pawnless endings are discussed on pages 259–288. External links Book review Interactive Chess Endgames vs Chess Computer Sergienko vs. Vescovi Moscow 2010, R+3N vs. R+B+N Volkov vs. Minasian Moscow 2009, Q+R+N vs. 2Q Chess endgames he:סיום (שחמט)#סיום ללא רגלים