Skip to main content
Article thumbnail
Location of Repository

Strategies for Constrained Optimisation

By Guy McCrossan Haworth


The latest 6-man chess endgame results confirm that there are many deep forced mates beyond the 50-move rule. Players with potential wins near this limit naturally want to avoid a claim for a draw: optimal play to current metrics does not guarantee feasible wins or maximise the chances of winning against fallible opposition. A new metric and further strategies are defined which support players’ aspirations and improve their prospects of securing wins in the context of a k-move rule

Publisher: The International Computer Games Association
Year: 2000
OAI identifier:

Suggested articles


  1. [Dva Konya protiv pešek. Sbornik šakhmatnykh étyudov.] Partly republished (1937) in Collection of Chess Studies, with a Supplement on the Theory of the End-Game of Two Knights against Pawns.
  2. (1996). 6-Piece Endgames.
  3. (1983). A Prophecy Fulfilled.
  4. (1984). A Proposed Revision of the ‘50-Move Rule’.
  5. (1987). A Six-Men-Endgame Database:
  6. (1986). Adjudicate This!!
  7. (1993). Back to Fifty.
  8. (1985). Company, the latter again re-published
  9. (1999). Exhaustive and Heuristic Retrograde Analysis of the KPPKP Endgame.
  10. (1988). Expert against the Oracle.
  11. (1991). First among equals.
  12. (2000). Server providing Nalimov’s EG statistics and tables.
  13. (1991). How Computers Play Chess.
  14. (1991). How to Win with a Knight Ahead.
  15. (2000). Position evaluation via Karrer’s KQQKQP≈/KQPKQP≈ sub-EGTs, Nalimov’s 3-6-man EGTs and Thompson’s 5-man EGTs and maximals.
  16. (2000). 6-man EGT maximal positions, maximal mutual zugzwangs and endgame statistics.
  17. (2000). CD publisher of Nalimov and Thompson endgame tables. ChessLab
  18. (2000). DTC win and draw statistics for 3-man to 6-man endgames.
  19. (1991). Karpov and Kasparov: the End is Perfection.
  20. (1996). Multilinear Algebra and Chess Endgames. Games of No Chance
  21. (1989). Parallel Analysis of Certain Endgames.
  22. (1986). Retrograde Analysis of Certain Endgames.
  23. (1994). Secrets of Pawnless Endings.
  24. (1906). Serialised analysis of KNNKP. Deutsche Schachzeitung.
  25. (1991). Some Results from a Massively Parallel Retrograde Analysis.
  26. (2000). Space-Efficient Indexing of Endgame Databases for Chess.
  27. (1989). The 50-Move Rule Adapted (1).
  28. (1989). The 50-Move Rule Adapted (2).
  29. The rook and bishop against rook.
  30. (1996). TYPES OF OPTIMAL PLAY These optimal lines proceed from the maximal KRNKNN position mxRN-NN of Table 1. A published line (Stiller,
  31. (1934). Два коня против пешек (теоретический очерк). Сборник шахматных этюдов, doi

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.