Computational complexity of generalized push fight

Computational complexity of generalized push fight

© Jeffrey Bosboom, Erik D. Demaine, and Mikhail Rudoy; licensed under Creative Commons License CC-BY 9th International Conference on Fun with Algorithms (FUN 2018). We analyze the computational complexity of optimally playing the two-player board game Push Fight, generalized to an arbitrary board an...

Full description

Bibliographic Details
Main Author: Demaine, Erik
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Format: Article
Language:English
Published: 2021
Online Access:https://hdl.handle.net/1721.1/137735

Internet

https://hdl.handle.net/1721.1/137735

Similar Items