Author: Fernando Villegas
Date: 15:48:37 09/11/99
Go up one level in this thread
Hi: I am not programmer, but I have the suspicious that that kind of thing is doable and possible and meaningful only with old programs with old algorythms. Now programs are very sophisticated in the way they search and so, time counting is too much flexible, I mean, they cannot know in advance how much time they will take as much even in the very end of the tree examination they can discover a new condition that changes dramatically the score and so they take more time. I think Mach III knew nothing about techniques like null move or just did not use many of the current extensions that are used today. As a spracklen program, Mach III was mainly brute force or full width. Of course I can be completely wrong. Maybe a real programmer could clarify this... fernando
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.