Author: Uri Blass
Date: 04:48:46 10/31/03
Go up one level in this thread
On October 31, 2003 at 07:17:17, Tord Romstad wrote: >On October 30, 2003 at 17:14:37, Christophe Theron wrote: > >>On October 30, 2003 at 13:04:02, Tord Romstad wrote: >> >>>How do you cope with this problem (high branching factor in the first >>>few plies) in Chess Tiger? Because your program runs on slow PalmOS units, >>>I suppose you must have some tricks to make the search more efficient >>>at low search depths. I am considering to make a PalmOS version of my >>>own program (a non-trivial task, because my current data structures are >>>too big to fit in such limited memory), therefore I would be very >>>interested to learn how you do it. >> >>I have a special system to deal with this, which is a legacy of my very old 16 >>bits version. >> >>But in general your problem will be to make the QSearch as small as possible >>while keeping a good tactical accuracy. This can be considered as 30% of the >>work involved in creating a competitive chess program. > >Thanks a lot. When you talk about creating a "competitive chess program" >above, are you talking about chess programs in general or just about >programs running on limited hardware? On fast hardware, it seems to >me that you find the entire spectre from no qsearch at all (Junior) to >really big qsearches (Hiarcs, perhaps The King?) containing many >non-capturing moves. I also got the impression in the past that Junior had no qsearch in the past and this impression was probably wrong. I even remember Amir saying that it has qsearch if I remember correctly(I remember a post of Amir when he said that he is going to need some months to rebuild Junior again in case that he lost his source code and as far as I remember he mentioned qsearch in that post as one of the things that he is going to need to do in that case). 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.