Author: Vincent Diepeveen
Date: 12:55:05 10/13/02
Go up one level in this thread
On October 13, 2002 at 15:47:43, Jeremiah Penery wrote: >On October 13, 2002 at 14:14:13, Vincent Diepeveen wrote: > >>On October 13, 2002 at 13:50:24, Jeremiah Penery wrote: >> >>for any chessprogrammer it is very clear Jeremiah. >> >>It's 12 ply and the 6 only means that the hardware search can >>be up to 6 ply within that 12 ply nominal. > >For the millionth time, explain 4(5) then. it's a lot easier when you try to imagine how you would start a search. Look at 4 ply you want to involve other cpu's too. You have 480 chess chips. 9 out of 10 is idling anyway (we know this because everyone says it was capable in theory to get a billion nodes a second in theory, yet it got only 126 million nodes on average; there is no discussion here) you want to use as many cpu's as possible. So at the root you ask a few chips. Of course you must take into account extensions too. If a 4 ply search for this chip is too much, then you split it. and split it. Giving a 2 ply search to chip A, and a 3 ply search to chip B. The 5 in short has no meaning here. You can see that the mainlines at the start of the game (so before hashtables are filled with a lot of info that extends lines) that the lines it gives at 4 , 5 , 6 ply is usually 1 ply long.
This page took 0.01 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.