A QUBO Formulation for the Generalized Takuzu/LinkedIn Tango Game
Alejandro Mata Ali, Edgar Mencia
TL;DR
This paper introduces a QUBO formulation for Takuzu and Tango games, optimizing variable count to enable quantum solutions on devices with limited resources, advancing quantum game-solving methods.
Contribution
It presents a novel QUBO formulation for Takuzu and Tango, reducing variable requirements for quantum computing applications.
Findings
Reduced the number of variables needed for quantum solutions
Applied QUBO formulation to Takuzu and Tango games
Facilitated quantum game-solving with fewer resources
Abstract
In this paper we present a QUBO formulation for the Takuzu game (or Binairo), for the most recent LinkedIn game, Tango, and for its generalizations. We optimize the number of variables needed to solve the combinatorial problem, making it suitable to be solved by quantum devices with fewer resources.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGuidance and Control Systems · Artificial Intelligence in Games · Quantum chaos and dynamical systems