Changes

Jump to: navigation, search

Distance

18 bytes added, 21:39, 16 May 2018
no edit summary
=Applications=
The main application of square distance is the static [[Evaluation|evaluation]] of the late [[Endgame|endgame]], where for instance races of the two kings to certain squares is often an issue - or in so called [[Mop-up Evaluation|Mop-up evaluation]], which considers the distance between winning and losing king. [[Boris Stilman]] gave following example to generate a set of [[Trajectory|trajectories]] for a king moving from f6 to h1 <ref>[[Boris Stilman]] ('''1994'''). ''A Linguistic Geometry of the Chess Model''. [[Advances in Computer Chess 7]], [http://www.stilman-strategies.com/bstilman/boris_papers/Jour94_CHESS7.pdf pdf draft]</ref>:
<pre>
D(f6,K) + D(h1,K) = SUM SUM == D(f6,h1)

Navigation menu