Author: Scott Gasch
Date: 23:20:03 07/19/99
Ok, I've heard people talking about pawn hash tables and this got me thinking about them. I am not sure how to do it -- 1) if you just hash 8 pawn locations and an associated evaluation that is pretty easy. It's a nice small number, can fit in memory, etc... However, you can't recognize passed pawns becasue you don't know where the enemy pawns are? 2) if you make a table with all 16 pawns in all possible configurations I calculate a total of 1120853258472 possibilities. That requires quite a bit of memory... ;) 3) do you mean just hash the recent scores for pawn structures? This way any node that has the same pawn structure anywhere in the tree can get the pawn score instantly? Thanks, Scott
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.