Author: Jacques Ruiz
Date: 04:06:39 03/10/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. > >could you please comment if this is possible in todays software. > >kburcham For instance if A is playing white with x, you mean using engine x for white moves (1,3,5,7 plies...) and engine xx for black moves (2,4,6,8 plies...), in the search, so the 2 engines kinda play ping-pong, calling each other when going to next ply in the search. With todays software as they are it don't think it could be possible, it would requiere adding special code in both engines. Also I don't think it is a good idea in itself, because engine x would inherit engine xx weaknesses and bugs, especially if engine x is already stronger than engine xx. For instance engine xx is using a special selectivity that make it miss some tactical threats that engine x would have seen alone. Some engines miss some tactical tricks deep in the tree but they don't miss it near the root (meaning that if you play a move that was hidding a threat they suddenly see it). So for instance engine x would play move M believing engine xx would play M', but in fact when engine xx starts thinking after move M played, on the other computer, it suddenly see something new (because of hashtable, selectivity etc...) and doesn't play M' as expected but a much better move. etc... Hope it helps.
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.