Author: Francis Monkman
Date: 16:31:23 07/18/99
Go up one level in this thread
On July 18, 1999 at 16:05:00, Robert Hyatt wrote: >Here's why it has a problem. Take a typical middlegame with roughly 35 moves. >If you have 1000 computers, you can go two half-moves into the future and search >those 1000 (35*35 roughly) positions. However, this is not very efficient as >alpha/beta needs the score for the 'best' (first) move before searching any of >the other moves... > >it is very difficult... I guess we could be talking more than that. Some guys have been trying to work out from the voting % the minimum number participating, but I've heard said 250,000 -- no idea if that means anything. Anyway, if they're voting, they're online someway. Couldn't we figure something out to do full-width for the first few ply or something? That would already be quite something, especially as the alpha-beta algorithm seems to have some problem here (ie good opponent moves not searched -- this topic's been discussed)? In fact, this game's showing up some interesting bugs in Fritz 5.32's calculations. There's a particular type of position in this game (in some lines), where Fritz wants ...Kc8, searching for minutes -- but the moment it's played, the eval goes bad by around 1 pawn!
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.