Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Robust game play against unknown opponents
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Simulation-based approach to general game playing
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
| Hi-index | 0.00 |
For general two-player turn-taking games, first solvers have been contributed. Algorithms for multi-player games like Maxn, however, cannot classify general games robustly, and its extension Soft-Maxn, which can play optimally against unknown and weak opponents, demands large amounts of memory. As RAM is a scarce resource, this paper proposes a memory-efficient implementation of the Soft-Maxn algorithm, by exploiting the functional representation of state and evaluation sets with BDDs.