Changes

Jump to: navigation, search

Draw

80 bytes added, 16:57, 17 November 2021
no edit summary
<span id="CrayBlitz"></span>
=Cray Blitz=
[[Cray Blitz]] applied a special draw heuristic, not uniformly using zero as draw score, but rather zero plus the [[Ply|ply]] distance to the [[Root|root]] to prefer later draws rather than a draw now. Additionally, the draw score range is disjoint from [[Evaluation|evaluation]] scores, which then exclude values around zero by adding or subtracting appropriate offsets if either greater or equal, or less than zero <ref>[[Harry Nelson]], [[Robert Hyatt]] ('''1988'''). ''The Draw Heuristic of Cray Blitz''. [[ICGA Journal#11_1|ICCA Journal]], Vol. 11, No. 1, pp. 3-9.]]</ref>.
=Draw Topics=
=Publications=
* [[David Slate]] ('''1984'''). ''Interior-node Score Bounds in a Brute-force Chess Program.'' [[ICGA Journal#7_4|ICCA Journal]], Vol. 7, No. 4, pp. 184-192]]* [[Harry Nelson]], [[Robert Hyatt]] ('''1988'''). ''The Draw Heuristic of Cray Blitz''. [[ICGA Journal#11_1|ICCA Journal]], Vol. 11, No. 1, pp. 3-9. ]]* [[Ernst A. Heinz]] ('''1998''') ''[http://people.csail.mit.edu/heinz/dt/node33.html Efficient Interior-Node Recognition]''. [[ICGA Journal#21_3|ICCA Journal]], Vol. 21, No. 3, pp. 156-167]]
* [[Vladan Vučković]], [[Đorđe Vidanović]] ('''2004'''). ''A New Approach to Draw Detection by Move Repetition in Computer Chess Programming.'' [https://arxiv.org/abs/cs/0406038 arXiv:cs/0406038] <ref>[https://www.stmintz.com/ccc/index.php?id=380201 Draw Detection by Move Repetition Procedure -- Comments] by [[Đorđe Vidanović]], [[CCC]], August 01, 2004</ref>
* [[Guy Haworth]] ('''2021'''). ''Chess without draws''. [[ICGA Journal#43_2|ICGA Journal, Vol. 43, No. 2]]
=Forum Posts=

Navigation menu