The difficulty of beating the Taxman
Combinatorics
2022-11-02 v1
Abstract
The Taxman game has proven to be hard to solve optimally, so efforts have been made to find heuristic strategies that do well in practice. We present results on the NP-hardness of a variant of the game via an equivalence to a particular kind of graph matching problem. Furthermore this equivalence is used to derive a winning strategy for all along with efficiently computable lower and upper bounds on the optimal achievable score.
Cite
@article{arxiv.2211.00461,
title = {The difficulty of beating the Taxman},
author = {Atli Fannar Franklín and Robert K. Moniot},
journal= {arXiv preprint arXiv:2211.00461},
year = {2022}
}