Author: Vincent Diepeveen
Date: 17:32:28 09/18/03
Go up one level in this thread
On September 18, 2003 at 11:05:15, Joel wrote: Yes it is very easy from my viewpoint. I did it in fact faster with suicide. I start with diep's source code simply. I define in diep.h a new thing called: #define DUMBPAWNSEARCH 1 Then all i do is copy the move generator of diep using that #define. i create a new recursive search function (of course not using any of diep's searching code except initialisation) and modify 1 thing that it allows to startup with a position without kings. Ok this is all 10 minutes work or so. Then to get the new move generator to work and the recursive function to work with a new function checking for a 'win' condition is another 2 hours work. So estimate is 2 hours to get something primitive to work. All i need to write is a few functions. Pretty easy. Then i would start adding stuff like hashtable call. That's adding 2 calls in the recursive search. Is that difficult? No of course not. So for the effort of 1 minute i have hashtables working. I ignore simply the evaluation table not getting used. So basically all i gotta do is make a new recursive search function which is very easy and trivial to make and less trivial to make is a stop condition (when one side has won) and an evaluation+move ordering. Don't be amazed when i manage in 3 hours. Dieter would perhaps manage 1 hour :) But in the end, i then start posting half a day here about the thing and chatting enthusiastically about it. That's why i say 1 day. >Actually, the more I think about writing an evaluation function for that game, >the more easy I think that problem is. > >Ok, I will accept your 'one day' claim. > >Joel
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.