The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Board Games AI
Abstract
The classical area of AI application is the board games. This chapter introduces the two most prominent AI approaches used in developing board game agents – the MinMax algorithm and Machine Learning and explains their usage in playing games like tic-tac-toe, checkers, othello, chess, go, etc., against human opponents. The game tree is essentially a directed graph, where the nodes represent the positions in the game and the edges the moves. Even a simple board game like tic-tac toe (noughts and crosses) has as many as 255,168 leaf nodes in the game tree. Traversing the complete game tree becomes an NP-hard problem. Alpha-beta pruning is used to estimate the short-cuts through the game tree. The board game strategy depends on the evaluation function, which is a heuristic indicating how good the player's current move is in winning the game. Machine learning algorithms try to evolve or learn the agent's game playing strategy based on the evaluation function.
Related Content
|
Yair Wiseman.
© 2021.
11 pages.
|
|
Mário Pereira Véstias.
© 2021.
15 pages.
|
|
Mahfuzulhoq Chowdhury, Martin Maier.
© 2021.
15 pages.
|
|
Gen'ichi Yasuda.
© 2021.
12 pages.
|
|
Alba J. Jerónimo, María P. Barrera, Manuel F. Caro, Adán A. Gómez.
© 2021.
19 pages.
|
|
Gregor Donaj, Mirjam Sepesy Maučec.
© 2021.
14 pages.
|
|
Udit Singhania, B. K. Tripathy.
© 2021.
11 pages.
|
|
|