https://www.chessprogramming.org/index.php?title=Mop-up_Evaluation&feed=atom&action=historyMop-up Evaluation - Revision history2024-03-29T06:35:43ZRevision history for this page on the wikiMediaWiki 1.30.1https://www.chessprogramming.org/index.php?title=Mop-up_Evaluation&diff=2121&oldid=prevGerdIsenberg: Created page with " '''Home * Evaluation * Game Phases * Endgame * Mop-up Evaluation''' '''Mop-up Evaluation''' might be applied at decided late endgame positions with..."2018-05-16T18:08:07Z<p>Created page with " '''<a href="/Main_Page" title="Main Page">Home</a> * <a href="/Evaluation" title="Evaluation">Evaluation</a> * <a href="/Game_Phases" title="Game Phases">Game Phases</a> * <a href="/Endgame" title="Endgame">Endgame</a> * Mop-up Evaluation''' '''Mop-up Evaluation''' might be applied at decided late endgame positions with..."</p>
<p><b>New page</b></p><div><br />
'''[[Main Page|Home]] * [[Evaluation]] * [[Game Phases]] * [[Endgame]] * Mop-up Evaluation'''<br />
<br />
'''Mop-up Evaluation''' might be applied at decided late endgame positions without any [[Pawn|pawns]], where one side has a winning advantage to [[Checkmate|checkmate]] and likely a [[Rook|rook]] or [[Queen|queen]] (or even two different colored [[Bishop|bishops]]). The winning side wants to drive the losing [[King|king]] to the edges and corners, and has therefor a bonus for [[Center Distance|Center distance]] ([[Center Manhattan-Distance|Center Manhattan-distance]]) of the losing king, and a bonus for a minimum distance of both kings. In practice one often uses some term based on the (weighted) sum of the [[Distance|Chebyshev distance]] and the [[Manhattan-Distance|Manhattan distance]], to have a higher bonus for the corners and straight rather than diagonal [[Opposition|opposition]]. <br />
<br />
=Chess 4.x=<br />
For instance, [[Chess (Program)|Chess 4.x]] Mop-up evaluation was based on sum of absolute [[Ranks#RankDistance|rank-]] and [[Files#FileDistance|file-distances]] <ref>[[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]]</ref>, something like this (ignoring knights, which were equally considered like the king) from the stronger side of view:<br />
<span style="font-size: 140%;">PosEval = 4.7 * CMD + 1.6 * (14 - MD)</span><br />
CMD is the Center Manhattan distance of the losing king and MD the Manhattan distance between both kings. Of course part of such terms might be covered by [[Piece-Square Tables|piece-square tables]] of that very late game stage, and most of these positions are handled by [[Interior Node Recognizer|interior node recognizer]] nowadays.<br />
<br />
=See also=<br />
* [[Center Distance]]<br />
* [[Center Manhattan-Distance]]<br />
* [[KBNK Endgame]]<br />
* [[KRK]]<br />
<br />
=Forum Posts=<br />
* [http://www.talkchess.com/forum/viewtopic.php?t=62257 Simple method for simple mates for programs without TBs] by [[J. Wesley Cleveland]], [[CCC]], November 25, 2016 ยป [[Center Manhattan-Distance]], [[KBNK Endgame]]<br />
<br />
=References=<br />
<references /><br />
<br />
'''[[Endgame|Up one Level]]'''</div>GerdIsenberg