From Imitation to Interaction: Mastering Game of Schnapsen with Shallow Reinforcement Learning

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Klačan, Ján, Zhang, Sizhong
Format: Preprint
Veröffentlicht: 2026
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866916020200931328
author Klačan, Ján
Zhang, Sizhong
author_facet Klačan, Ján
Zhang, Sizhong
contents This paper investigates whether shallow neural network agents can master the card game Schnapsen and challenge a strong search-based baseline, RdeepBot, which uses Monte Carlo sampling and lookahead search. Guided by a progressively more complex experimental design, we first evaluate a supervised learning agent (MLPBot) trained on replay data and then a reinforcement learning agent (RLBot) with the same shallow architecture trained through asynchronous Monte Carlo updates and experience replay. The results show that supervised imitation does not generalize well enough to defeat strong RdeepBot opponents, whereas reinforcement learning produces substantially stronger agents. In the setting that focuses on the depth parameter of RdeepBot, the best performance is achieved when the learned value function is combined with deeper lookahead during gameplay, allowing RLBot to achieve statistically significant higher winning rates against the strongest evaluated RdeepBot baseline. In the sample-based setting, the gains are more conditional: the strongest performance appears at a relatively lower training num_samples parameter rather than increasing uniformly with stronger sampling.
format Preprint
id arxiv_https___arxiv_org_abs_2605_17162
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle From Imitation to Interaction: Mastering Game of Schnapsen with Shallow Reinforcement Learning
Klačan, Ján
Zhang, Sizhong
Artificial Intelligence
Machine Learning
68T07 (Primary) 68T05, 68T20 (Secondary)
I.2.6; I.2.8
This paper investigates whether shallow neural network agents can master the card game Schnapsen and challenge a strong search-based baseline, RdeepBot, which uses Monte Carlo sampling and lookahead search. Guided by a progressively more complex experimental design, we first evaluate a supervised learning agent (MLPBot) trained on replay data and then a reinforcement learning agent (RLBot) with the same shallow architecture trained through asynchronous Monte Carlo updates and experience replay. The results show that supervised imitation does not generalize well enough to defeat strong RdeepBot opponents, whereas reinforcement learning produces substantially stronger agents. In the setting that focuses on the depth parameter of RdeepBot, the best performance is achieved when the learned value function is combined with deeper lookahead during gameplay, allowing RLBot to achieve statistically significant higher winning rates against the strongest evaluated RdeepBot baseline. In the sample-based setting, the gains are more conditional: the strongest performance appears at a relatively lower training num_samples parameter rather than increasing uniformly with stronger sampling.
title From Imitation to Interaction: Mastering Game of Schnapsen with Shallow Reinforcement Learning
topic Artificial Intelligence
Machine Learning
68T07 (Primary) 68T05, 68T20 (Secondary)
I.2.6; I.2.8
url https://arxiv.org/abs/2605.17162