Affiliations: [a] Department of Computer Science, University of Limburg, Maastricht, The Netherlands | [b] Department of Technical, Mathematics and Informatics, Delft University of Technology, Delft, The Netherlands
Note: [1] This is part 1 of a revised version of the paper delivered under the title Thoughts on the Application of Opponent-Model Search on July 2, 1993, at the 7th Conference on Advances in Computer Chess, Maastricht, the Netherlands. It will be published in full in the Proceedings of that conference.
Note: [*] Presently affiliated to the Department of Computer Science, Tokyo University of Agriculture and Technology.
Abstract: 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.
DOI: 10.3233/ICG-1993-16403
Journal: ICGA Journal, vol. 16, no. 4, pp. 201-208, 1993
