Proceedings of the 2021 International Conference on Social Development and Media Communication (SDMC 2021)

Performance Comparison of Algorithms in Cake Cutting Game

Authors
Yensheng Ma1, Shiyu Liu2, *
1School of Artificial Intelligence, Hebei University of Technology, Tianjin, 300132, China
2School of Cyber Engineering, Xidian University, Xi’an Shaanxi, 710126, China
*Corresponding author. Email: ariel_0818@163.com
Corresponding Author
Shiyu Liu
Available Online 17 January 2022.
DOI
10.2991/assehr.k.220105.005How to use a DOI?
Keywords
Game design; Greedy Algorithm; Dynamic Programming Algorithm; Depth first search (DFS); Minimax Theorem
Abstract

In recent years, games have become a hot field with great commercial value. And artificial intelligence in games became a important part of game design. In order to develop a sophisticated and efficient game AI, the algorithm implemented in the AI will play a role that cannot be ignored. Man-machine combat is a part of almost every game. However, how to choose the most appropriate algorithm to make computer players have better efficiency and winning rate, so as to bring real players a better experience is still a problem to be studied. Cake cutting is a simple game. We construct this game as an example to judge the efficiency comparison of four algorithms in this game, match different algorithms in pairs, and find the algorithm with the highest winning rate by considering factors such as first hand and then hand, the running time, memory occupation and CPU occupation rate of the game which are the factors for us to judge the efficiency. After research, we find that Minimax theorem is the algorithm with the best winning rate when taking no care of running time.

Copyright
© 2022 The Authors. Published by Atlantis Press SARL.
Open Access
This is an open access article under the CC BY-NC license.

Download article (PDF)

Volume Title
Proceedings of the 2021 International Conference on Social Development and Media Communication (SDMC 2021)
Series
Advances in Social Science, Education and Humanities Research
Publication Date
17 January 2022
ISBN
978-94-6239-512-1
ISSN
2352-5398
DOI
10.2991/assehr.k.220105.005How to use a DOI?
Copyright
© 2022 The Authors. Published by Atlantis Press SARL.
Open Access
This is an open access article under the CC BY-NC license.

Cite this article

TY  - CONF
AU  - Yensheng Ma
AU  - Shiyu Liu
PY  - 2022
DA  - 2022/01/17
TI  - Performance Comparison of Algorithms in Cake Cutting Game
BT  - Proceedings of the 2021 International Conference on Social Development and Media Communication (SDMC 2021)
PB  - Atlantis Press
SP  - 17
EP  - 22
SN  - 2352-5398
UR  - https://doi.org/10.2991/assehr.k.220105.005
DO  - 10.2991/assehr.k.220105.005
ID  - Ma2022
ER  -