Author: Frank Schneider
Date: 13:12:42 08/17/02
Go up one level in this thread
On August 17, 2002 at 15:17:32, Engin Üstün wrote: >On August 17, 2002 at 14:14:08, Frank Schneider wrote: > >>On August 17, 2002 at 13:38:46, Engin Üstün wrote: >> >>>i want not to discuss about fast bitboards or bit operations! >>> >>>my title is why write a fast chess program, >>>and not a selective search program like a human chess player. >> >>Even a selective program will be stronger if it's fast. >> >>> >>>i positions if alpha > beta cuts the program, but if not is searching all moves. >>> >>>i am thinking about the program picked some 1-5 possible canditate moves in a >>>position and search only them. >> >>This is a very old idea - in fact when computers were slow >>everybody tried it (Kaissa, Chess 3.0, Pioneer). >> >> >>Todays best programs are quite selective, they have a branching factor >>of about 2.x. It's not easy to improve that, but of course everybody >>tries. >> >>Frank > >i mean not null move , extensions or pruning of moves. > >i mean if the program try only 2 moves in a position that can search very deep >and beats every human players. > >2^18 = 262144 nodes is enough :-) When you only try 1 move in a position you don't have to search at all (1^18 = 1 node is enough). > >not thausends or millions of nonsense positions. IMHO it doesn't matter if you use a slow but super-intelligent eval or some quick searches to find out which moves are interesting. However, so far nobody was able to write this "super-intelligent eval". Good luck Frank
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.