Welcome to EPrints UTCC

Karnjanapoomi, N. and Pramanpol, P. and Lertratsamewong, V. and Chacavarnkitkuln, T. and Rattanajongjittakorn, V. and Thavaravej, C. and Wattanapornprom, W. and Rodkaew, Y. (2013) A nondominated adversarial search algorithm for a threeplayer chess game. In: 2013 International Computer Science and Engineering Conference.


Download (114kB) | Preview


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.

Item Type: Conference or Workshop Item (Paper)
Uncontrolled Keywords: artificial intelligence; game; Minimax algorithm; Nondominated sorting; three player chess
Subjects: Engineering > Computer and Multimedia Engineering
Divisions: Research Center > Research Support Office
Depositing User: Miss Niramol Sudkhanung
Date Deposited: 20 Jun 2016 08:35
Last Modified: 20 Jun 2016 08:35
URI: http://eprints.utcc.ac.th/id/eprint/5664

Actions (login required)

View Item View Item