Changes

Jump to: navigation, search

Evaluation Function Draft

23 bytes added, 13:38, 25 April 2019
no edit summary
<span id="Distance"></span>
==Distance==
When the program is turned on, it must fill the tables with bonuses for [[Distance|distance]] between any two squares that will be used for evaluating [[King Safety#KingTropism|king tropism]]. The following formula is borrowed from the masters thesis by [[Adam Kujawski]] <ref>[[Adam Kujawski]] ('''1994'''). ''Programowanie gry w szachy''. Masters thesis, [[University of Warsaw]], [http://www.armageddon.szachmkarasinski.pl/joanna_cms/files/Adam%20Kujawski%20szachy.pdf pdf] (Polish)</ref> and modified in such a way that all the scores become positive. It assumes that both rows and columns are numbered from 0 to 7 and that we have a function "abs" returning the value without the sign.
<pre>
</pre>
At the beginning we can assume that bk_dist is equal to rk_dist, but there is a better idea, taking into account the relevance of a [[DiagonalDiagonals|diagonal]]. To apply it, we need two tables numbering the diagonals and [[Anti-Diagonals|anti-diagonals]].
<pre>
int diag_nw[64] = {

Navigation menu