Please use this identifier to cite or link to this item:
|Title:||A nondominated adversarial search algorithm for a threeplayer chess game||Authors:||Karnjanapoomi, N.
|Keywords:||artificial intelligence;game;Minimax algorithm;Nondominated sorting;three player chess||Issue Date:||2013||Publisher:||University of the Thai Chamber of Commerce||Source:||N. Karnjanapoomi, P. Pramanpol, V. Lertratsamewong, T. Chacavarnkitkuln, V. Rattanajongjittakorn, C. Thavaravej, W. Wattanapornprom, Y. Rodkaew (2013) A nondominated adversarial search algorithm for a threeplayer chess game., 196-200.||Conference:||2013 International Computer Science and Engineering Conference||Abstract:||Threeplayer (3P) chess is a variation of chess game specially designed for three players. The winning condition that the first player will wins if the player captures any of the other's King, arises the playing strategies that a player can form a temporarily alliance with another player or a player can take advantage from the other's attacking to defeat either two of the opponents. This paper proposes a search algorithm called the nondominated adversarial search (NAS) for the threeplayer chess game which does not only maximize the own score but also minimize the opponents' scores. The experiment shows that the NAS algorithm can take advantage from the other's attacking to win the game.||URI:||https://scholar.utcc.ac.th/handle/6626976254/3461||Rights:||This work is protected by copyright. Reproduction or distribution of the work in any format is prohibited without written permission of the copyright owner.|
|Appears in Collections:||RSO: Conference Papers|
Show full item record Recommend this item
checked on Jul 11, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.