Author: Anthony Cozzie
Date: 09:57:08 09/16/03
Go up one level in this thread
>>>>2. All data is accessible at any time/place in the search. >>> >>>Funny. I would have listed that under "disadvantages". :) >> >>you c++ abstraction wussies. IMO, making a chess engine fast is more important >>than abstraction. Its not like "int alpha" is going to change its function any >>time soon. > >Hehe! I'd also put it under "disadvantages" in pure C. :) And no, "int alpha" >probably isn't going to change any time soon, but I would hate it, if the >evaluation function not only evaluates the current position but destroys the >movelist 2 plies higher in the tree. :)) we call that an optimization. The best way to lower the branching factor is with smaller movelists ;) >>for example trans_table_lookup() requires, alpha, beta, ply, depth, etc. >>How do you get around this? > >I would pass alpha, beta, ply and depth as parameters to trans_table_lookup(). >:) Do you feel that 4 parameters are too much? (I guess you have speed >concerns?) IIRC, the search() of my C-engine had 8 parameters. That's probably >the limit I'd like to have. Otherwise I feel that the function is too >complicated anyhow.
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.