2024/10/08 by Alejandro Mata Ali, Ali, Alejandro Mata, Edgar Mencia +1
Decision Sciences · Engineering · Mathematics · #81Q99 #90C20 #90C27 #Computer science #Emerging Technologies (cs.ET) #FOS: Computer and information sciences #FOS: Physical sciences #G.1.6 #G.2.1 #Game Theory and Applications #Game theory #Mathematical economics #Mathematics #Military Defense Systems Analysis #Popular Physics (physics.pop-ph) #Quantum Physics (quant-ph)
paper · pdf · doi:10.48550/arxiv.2410.06429
published in arXiv (Cornell University) (Cornell University)
openalex publication_date 2024/10/08 · openalex created_date 2024/10/12 · openalex updated_date 2026/07/28
In this paper, we present a QUBO formulation designed to solve a series of generalisations of the LinkedIn queens game, a version of the N-queens problem, for the Takuzu game (or Binairo), for the most recent LinkedIn game, Tango, and for its generalizations. We adapt this formulation for several particular cases of the problem, as Tents & Trees, by trying to optimise the number of variables and interactions, improving the possibility of applying it on quantum hardware by means of Quantum Annealing or the Quantum Approximated Optimization Algorithm (QAOA). We also present two new types of problems, the Coloured Chess Piece Problem and the Max Chess Pieces Problem, with their corresponding QUBO formulations.