Author: Gerd Isenberg
Date: 06:51:16 12/15/05
Go up one level in this thread
On December 15, 2005 at 08:56:14, Richard Pijl wrote: >On December 15, 2005 at 05:59:21, Gerd Isenberg wrote: > >>Hi, >> >>recently there was the question about a knight-distance formula. >>Mungjong pointed out the idea with the 0x88 square difference and a lookup, >>while Uri mentioned the edge-cases which require some special handling. >> >>I still have my precalculated 64*64 array with packed distance, taxi-distance, >>knight-distance and this udr-value (unique distance relation). >> > >I'm not sure what you can do with the knight-distance. Hi Richard, yes, you are right - the usability of knightDistance seems very limited. One may precheck some things - to look for knight-checks, or to look for some knight forks - or to increase some white eval noise - to minimize some knight distance to opposite king... Like to solve some math puzzle, i was simply curious about some ressource friendly procedure/formula to calculate that knight distance - and thought about some multiplication and modulo stuff... For the positions you mention i would prefer a fill based approach - considering intermediate checks might be interesting - but of course there might be a lot of other interactions. http://hornid.com/cgi-bin/ccc/topic_show.pl?pid=442226;hl=#pid442226 http://chessprogramming.org/cccsearch/ccc.php?art_id=252020 Gerd
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.