TY - JOUR
T1 - Potential Applications of Opponent-Model Search - Part 1: The Domain of Applicability
AU - IIDA, H
AU - UITERWIJK, JWHM
AU - van den Herik, Hendrik
AU - HERSCHBERG, IS
PY - 1993/12
Y1 - 1993/12
N2 - An opponent is modelled by assumed knowledge of his evaluation of positions in a game. Exploiting this knowledge and assuming the opponent to be fallible, the opponent may be outwitted by anticipating his errors. Though the moves so generated need not be optimal in some minimax sense, the model may confer an advantage to the modelling player. Conditions are derived for what is, in essence, a minimum distance between the two player's strategies; notably, an impetuous opponent is seen to labour under the same disadvantage as one with shallower search depth.
AB - An opponent is modelled by assumed knowledge of his evaluation of positions in a game. Exploiting this knowledge and assuming the opponent to be fallible, the opponent may be outwitted by anticipating his errors. Though the moves so generated need not be optimal in some minimax sense, the model may confer an advantage to the modelling player. Conditions are derived for what is, in essence, a minimum distance between the two player's strategies; notably, an impetuous opponent is seen to labour under the same disadvantage as one with shallower search depth.
U2 - 10.3233/ICG-1993-16403
DO - 10.3233/ICG-1993-16403
M3 - Article
SN - 0920-234X
VL - 16
SP - 201
EP - 208
JO - ICCA Journal
JF - ICCA Journal
IS - 4
ER -