Author: leonid
Date: 18:26:33 10/29/99
Hi! It is for some time I am trying to find the raw speed of "positional logic" and maybe today it is my chance. We reached the week-end! Everybody is on Internet! I want to find at what speed generally logic (in chess game) find the move when it looks through all the possibilies. I want to say that search goes at "brute force" and at "fixed depth" without any extensions. Those funny extensions is the reason why I can't find this apparently simple response on my own. Maybe we have some place that even deel with the raw speed of the game that I never find. Recently, for instance, I descovered that we have some places that could help me in the past to recognize the speed of my strange "mate solving logic". We even have few men that wrote something like mine "mate solving logic". Logic for solution of mate containing positions. I found through the Heiner Marxen page (he write its logic for soving the mate) one unique link to the next forgotten place in our strange world. This place (page of Valentin Albillo for 1997) contain actually magnificently documented mate containing positions with all the data that I could only dream when I needed it. Maybe the same existe for "positional logic". I just don't know where I can find the response that I need. I will write here, for the sake of "maybe", the time that positional logic took for solving one position. Maybe you could give your estimation of speed without that much data at all. Initial position of every chess game. Move for this position is found though the logic. Identical search done for 6, 8 and 10 plys. AMD 400M. Brute force search at fixed depth. No extensions. 6 plys 8 plys 10 plys 0.27 sec. 11 sec. 421 sec. Thanks, Leonid.
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.