Recently a strong poker-playing algorithm called DeepStack was published, which is able to find an approximate Nash equilibrium during gameplay by using heuristic values of future states predicted by deep neural networks. This paper analyzes new ways of encoding the inputs and outputs of DeepStack’s deep counterfactual value networks based on traditional abstraction techniques, as well as an unabstracted encoding, which was able to increase the network’s accuracy.
CITATION STYLE
Hopner, P., & Loza Mencía, E. (2018). Analysis and optimization of deep counterfactual value networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11117 LNAI, pp. 305–312). Springer Verlag. https://doi.org/10.1007/978-3-030-00111-7_26
Mendeley helps you to discover research relevant for your work.