Author: blass uri
Date: 07:44:05 06/10/98
Go up one level in this thread
On June 10, 1998 at 06:39:35, Amir Ban wrote: >I don't know anything about suicide chess, but at some level it becomes >poor strategy to assume that your opponent will make mistakes. I think if the computer see that the opponent has an adventage of more than 2 pawns it is better to assume the opponent will make mistakes otherwise the computer can do moves that do not give it a practical chance there are some assumption that can be done 1)you can assume in this case that the opponent must do in the next move the move the computer would do if it had only 1 second per move. 2)you can assume the human opponent will miss long moves. but I think it is not very important for top programs because in most of the cases these ideas will not help against strong opponents. > It's ok >to try to create the sort of game where you are more comfortable than >your opponent, but in reality strong humans are very good at doing this, >while computers, despite all intentions of the programmers, usually >cooperate. > >When your opponent is in time pressure and you are not, you want to make >things complicated, but to play quickly yourself is an elementary error. I think for computers it is not a mistake to play more quickly than usual because computers are better than humans at blitz I think that if the opponent is in time trouble the computer should use more time than the opponent but less than the usual time (I think a geometric mean of the time the computer has for a move and the time the human has for a move is a good idea of the amount of time the computer should waste). another thing that should be done if the opponent is in time trouble is to increase the value of the computer's pieces in the evaluation function so the computer will be against trading pieces and against a draw by 3 time repetition. I think increasing the value by 10% if the opponent has 1 minutes for all the game is good. the number of % of change in the value of pieces can be proportional to 1/x when x is the number of minutes the opponent has for all the game. Uri
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.