Author: James Robertson
Date: 20:53:36 01/07/99
Hi, I have just started implementing hash tables into my program. Already, I have run into *major* problems. Most of them I can probably fix on my own, but a few I need help with: Problem #1 Out of a search of maybe 700k nodes (counting q-nodes), I will only get maybe 6k positions that the program attempts to enter into the tables! What is a reasonable number of storage attempts for a program during a search of that length? Problem #2 I get tremendously few hits, but that is probably because of problem #1. I figured these would be the best solutions to my problems: Solution #1 Someone posting a simple alpha-beta function somewhere where so I can see where what hash stuff (probes, etc.) goes where. Solution #2 Someone also explaining the above code. Solution #3 Someone speculating on what I might be doing wrong (less crucial). Please help!! James
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.