Author: Andreas Guettinger
Date: 11:42:24 08/12/03
Go up one level in this thread
On August 12, 2003 at 06:23:26, macaroni wrote: >Hi, >in an alpha-beta search, with hash tables, null moving, history heuristic, >killers, pvs search, quiescent search, and itterative deepening. >about how many nodes would one expect after a 6 ply search from the opening >position, I get 13,000, is this way to many? or about right. >Also, about how much extra performance would one expect from killers? I seem to >get a really marginal increase, what replacement scheme is good for killers? >thanks. My (poor) program takes 817463 nodes to ply 6. That reminds me of a ot of work I have to do: Hashtables, Killer, Histry table etc, etc. :-) ply time score nodes pv 1 0.00 30 20 e2e4 2 0.00 0 85 e2e4 e7e5 3 0.01 25 1554 e2e4 g8f6 b1c3 4 0.12 0 10066 g1f3 g8f6 d2d4 d7d5 5 0.71 21 98368 g1f3 g8f6 d2d4 d7d5 b1c3 6 5.72 1 817463 e2e4 e7e5 d2d4 g8f6 f1b5 f8b4 c2c3
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.