Abstract
In this article, we present an interpretable artificial intelligence, and its associated machine learning algorithm, that is capable of automatically learning the rules of a game whenever the rules—the relationship between a player’s current state and their corresponding set of legal moves—can be represented as a set of low degree Zhegalkin polynomials, a special class of Boolean functions. This is true for many popular games including <i>Spanish Dominó</i> and the card game <i>President</i>. Our method takes advantage of such low polynomial degree to compute an exact representation of the rules in polynomial time instead of the required exponential time for generic Boolean functions. The rules can also be represented using significantly less storage than in the generic case which, for many games, leads to a representation that is easy to interpret.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
