Author: Duncan Roberts
Date: 08:22:32 02/15/05
Go up one level in this thread
On February 15, 2005 at 08:46:30, Andrew Wagner wrote: >Well, after CCT7 I've got the chess programming bug in my blood again. But I >have no desire to go back to working on Trueno, mostly because I think I proved >my point with it. A competitive chess engine CAN be written in a VB-type >language. > >Anyway, my idea now is to create an engine with parts that are as generic as >possible. The idea being that I want to be able to easily swap out, say, an >alphabeta search, and replace it with a mini-max search. Or switch from >bitboards to 0x88 easily. The minimum goal of the project would be to be able to >write all my own parts and have them function interchangeably. Ideally, I'd like >to really make things generic and re-usable to the extent that I could swap in >parts from other engines, eventually. So if I want to compare the speeds of >Fruit's eval() with that of Crafty, I can do it with minimal code changing, >regardless of whether or not they use the same board representation or type of >search, or whatever. I think I'd like to write it in Perl, too, just for grins >and giggles. Not something you hear much of. > >Anyway, thoughts? Suggestions? Accusations of sheer dementia? Bring 'em on! http://www.cs.biu.ac.il/~davoudo/genesis/readme.txt A feature that is unique to this engine, is that you choose the search algorithm. Unlike other engines that have a fixed search algorithm (for example NegaScout + null-move pruning), this engine can adopt any of the following algorithms: NegaScout or AlphaBeta Aspiration window size Null move pruning on or off Set the 'R' parameter of null-move search Use standard or verified null-move pruning Quiescence on or off (check extensions on or off) Set hash table size or hash table off Opening book on or off And much more...
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.