Author: Uri Blass
Date: 01:41:52 04/26/02
Go up one level in this thread
On April 26, 2002 at 04:30:17, Uri Blass wrote: >On April 26, 2002 at 04:11:26, Odd Gunnar Malin wrote: > >>On April 26, 2002 at 03:49:27, Uri Blass wrote: >> >>>On April 26, 2002 at 03:20:36, Odd Gunnar Malin wrote: >>> >>>>On April 25, 2002 at 12:01:12, Uri Blass wrote: >>>>>My program in the 5th division of the winboard programs >>>>>has 9.5 out of 11 >>>>>inspite of not having opening book,hash tables,pondering >>>>>and even does not use the null move pruning that >>>>>seems to be a significant improvement relative to >>>>>the previous version. >>>>> >>>>>Uri >>>> >>>>As I read before so did you start with an 4 div. engine (tscp) and apply changes >>>>to this that would gain speed etc. >>>>When you compare with the engines in 5 div. you have to remember that these are >>>>engines that start from scratch, with reading ideas and pseudo code and not >>>>source codes. >>>> >>>>Odd Gunnar >>> >>> >>>I did not start by modifying tscp. >>> >>>I do not know if to say that I started from scratch because I copied part of the >>>data structures from tscp. >>> >>>I started by move generator of only legal moves. >>>My code may has may have today 10% in common with tscp. >>> >>>I copied part of the data structure of tscp but most of my varaible are not from >>>tscp and I never used a lot of variables that are needed for tscp. >>> >>>Here are list of arrays that were never used by my program: >>> >>>int mailbox[120] >>>int mailbox64[64] >>>BOOL slide[6] >>>int offsets[6] >>>int offset[6][8] >>>char piece_char[6] >>> >>>My program today also does not use the following arrays but it used them in the >>>past. >>> >>>int color[64]; >>>int piece[64]; >>> >>>some arrays are also used today >>> >>>gen_t gen_dat[GEN_STACK]; >>>int first_move[MAX_PLY]; >>>int history[64][64]; >>>hist_t hist_dat[HIST_STACK]; >>>move pv[MAX_PLY][MAX_PLY]; >>>int pv_length[MAX_PLY]; >>>int castle_mask[64]; >>> >>>Uri >> >>Hi. >> >>I don't want to start a discussion on this but my reflection was: >> >>In the node/move debate you argued that you did no pruning so all generated >>moves is also a node. I can add that I looked in the winboard forum for my posts and I could only find a posr that say that my program does pruning that is not null move pruning(alpha beta is not considered by me as pruning) Here is the relevant post http://f11.parsimony.net/forum16635/messages/25777.htm I am interested to know what is the post that gave you the impression that I argued that I did no pruning. sune fsher also discussed about this subject and he does not consider the alpha beta algorithm as pruning. He answered me that when he said null move he meant also to other pruning but I am sure that he did not mean to the alpha beta algorithm that every good program use. Uri
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.