Home * Evaluation * Game Phases * Endgame * KRK
external image 8%20w&size=medium&coord=no&cap=no&stm=yes&fb=no&theme=classic&color1=E3CEAA&color2=635147&color3=000000

the King and Rook versus King endgame is beside KQR the most elementary endgame with three pieces. If the rook can not be captured immediately - or the losing king isn't stalemated, checkmate can be forced by driving the losing king to the edge or corner of the board, the rook giving mate similar to the back-rank mate, the winning king locking all escape squares, often initiated by a rook tempo move to force the king into opposition.
KRK Mate in Two


Simple heuristics of a mop-up evaluation [1], only considering Center Manhattan-distance of the losing king, and Chebyshev distance and/or Manhattan distance between both kings, along with a tiny search, should be sufficient to execute the mate. Further, the rook may receive a bonus to maximize the absolute difference of its rank- and file-distances to the losing king, to confine the king without becoming attacked.

Despite todays engines have no difficulty to win this easily even without tablebases, deviation from optimal tablebase play, in particular in games with short time control, and most compact and efficient code considering symptoms of search pathology remain interesting issues [2].


First implemented by Leonardo Torres y Quevedo in 1912 within his electro-mechanical KRK solver El Ajedrecista, KRK was and still is testbed and subject of research on evaluation and search heuristics and strategies, oracle approaches, mate search, search pathology, search versus knowledge, space-time tradeoff, retrograde analysis and tablebase generation [3], knowledge extraction and compression, feature detection and tuning, learning [4], genetic programming, pattern recognition, decision trees, logic and logic programming [5], inductive and deductive reasoning, rule-based modeling, problem solving and SAT [6]. In 1977, Donald Michie addressed KRK and the infinite board [7].

See also

Selected Publications


1960 ...

1970 ...

1980 ...

1990 ...

2000 ...

2010 ...

Forum Posts

External Links


  1. ^ David Slate, Larry Atkin (1977). CHESS 4.5 - The Northwestern University Chess Program. Chess Skill in Man and Machine, reprinted (1988) in Computer Chess Compendium
  2. ^ Why minimax is fundamentally flawed by Harm Geert Muller, CCC, November 09, 2014
  3. ^ Thomas Ströhlein (1970). Untersuchungen über kombinatorische Spiele. Ph.D. Thesis, Technical University of Munich (German)
  4. ^ Michael Bain (1994). Learning Logical Exceptions in Chess. Ph.D. thesis, University of Strathclyde
  5. ^ Ivan Bratko (2001,2010). Prolog programming for artificial intelligence. Harlow England, Addison Wesley
  6. ^ Marko Maliković, Predrag Janičić (2013). Proving Correctness of a KRK Chess Endgame Strategy by SAT-based Constraint Solving. ICGA Journal, Vol. 36, No. 2
  7. ^ Donald Michie (1977). King and Rook Against King: Historical Background and a Problem on the Infinite Board. Advances in Computer Chess 1
  8. ^ Donald Michie (1976). AL1: a package for generating strategies from tables. ACM SIGART Bulletin, Issue 59
  9. ^ Diploma Theses — IDB
  10. ^ Uni Bonn - AG Intelligente Datenbanken - Was sind intelligente Datenbanken?

What links here?

Up one Level