Author: Thorsten Czub
Date: 11:37:55 07/01/03
Go up one level in this thread
On July 01, 2003 at 09:10:04, Mike Hood wrote: >Yes... a few years ago Chris Whittington made some very interesting suggestions >along the lines of the original post in this thread. To paraphrase his words >from memory: "A move should be chosen by static evaluation of the current >position based on positional considerations. chess system tal ordered the moves statically with the INTERESTING function. only by evaluation. the search later was used to find a plan. an attack. or a sac. >Maybe a short search of three or >four plies is necessary to avoid obvious blunders, but the evaluation should not >be based on a depth search". Chris's ideas sounded very exciting when I first >read them, and I have to admit that I was disappointed that the program based on >these ideas, Chess System Tal, didn't perform as well as the deep searching bean >counters. this is not true. when CSTal 1 came out it was able to perform good against the latest bean counters. it scored good against all kind of programs. We played many games and tournaments to show this in real life. It was able to beat genius on a championship. it made a good game against an older junior version. there are plenty of those games on my web page. http://www.thorstenczub.de/scw.html if you like you can replay them. >Maybe more research (or rather experimentation) should be done along >this path. maybe. chris whittington sold his company and stopped programming. but IMO the approach is worth another try.
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.