Author: Stuzzi Kadent
Date: 09:46:50 08/18/02
Go up one level in this thread
On August 17, 2002 at 15:02:45, Engin Üstün wrote: >i sad the most of programs today not all. >sorry but i want not discuss wich programs are fast or used bitboards. > >i meaned is not exist other ways to write a strong engine using selective >methods. >i mean not null move or extensions. >to try 1-5 moves per position not more and reduce the nodes and search tree >extremently. >problem is what 1-5 moves are there to try search. >i know that is a old idea, but i see nobody of programers are to try this way. > >programs been faster and faster, is that the only one way? Mikhail Botvinnik, a world chess champion, spent about 30 years trying to construct a computer that would play like a human. Averbakh thought he wasted that time. I have not heard of anything very useful coming of it. Humans see chunks of the board and patterns. Even today attempts to autonomously guide robots by "seeing" everyday visual stimuli are not quite reliable. So the current tree searching methods are the most practicable until this issue is solved.
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.