Author: Pham Hong Nguyen
Date: 22:24:01 03/09/03
Go up one level in this thread
On March 10, 2003 at 00:05:06, K. Burcham wrote: > > >When program A is playing against program B in a game, we know that program >A is looking for best move to play based on its own search for next move to >reply to its own move. Then searches for next best reply to that move, and next >best reply to that move, etc. All this based on its own search. >In other words, if a program is playing white, it is also playing black at the >same time, in its own eval. A programs eval doesnt even know its actually >playing against another program, it thinks it is playing against itself. > >I was wondering, lets say this game is being played at one of the chess sevrers. > >1. opponent A has two computers. On one computer opponent A has program x. On >his other computer opponent A has program xx. Both with very strong hardware. > >2. opponent B has one computer. On his computer opponent B is running program >xx. Very strong hardware. > >what if opponent A was able to enter expected moves of program xx into program >x. It would seem that this would be advantage. The main problem is that the first computer of A has to wait a while, say 3 minute for sencond computer (whith xx program) to find out xx's move. By the same time, the real opponent (xx of B) also finish his move and send you the real move via the net. It means that the work of the sencond one become redundant / useless. The better idea is that you take two CPUs out and reassemble them into a dual (an improvement of 1.7) :) Actually, I have been thinking about of use computers on a LAN for chess, but the idea is quite different and the benefit I guess is around only 10-20% of improving score - may not enough for anyone to concern. Pham > >could you please comment if this is possible in todays software. > >kburcham
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.