Individual subject evaluated difficulty of adjustable mazes generated using quantum annealing

In this study, the maze generation using quantum annealing is proposed. We reformulate a standard algorithm to generate a maze into a specific form of a quadratic unconstrained binary optimization problem suitable for the input of the quantum annealer. To generate more difficulty mazes, we introduce...

Full description

Saved in:
Bibliographic Details
Published inFrontiers in computer science (Lausanne) Vol. 5
Main Authors Ishikawa, Yuto, Yoshihara, Takuma, Okamura, Keita, Ohzeki, Masayuki
Format Journal Article
LanguageEnglish
Published Frontiers Media S.A 07.12.2023
Subjects
bar-tipping algorithm
combinatorial optimization
maze generation
quantum annealing
time-to-solution
Online AccessGet full text

Cover

More Information
Summary:In this study, the maze generation using quantum annealing is proposed. We reformulate a standard algorithm to generate a maze into a specific form of a quadratic unconstrained binary optimization problem suitable for the input of the quantum annealer. To generate more difficulty mazes, we introduce an additional cost function Q update to increase the difficulty. The difficulty of the mazes was evaluated by the time to solve the maze of 12 human subjects. To check the efficiency of our scheme to create the maze, we investigated the time-to-solution of a quantum processing unit, classical computer, and hybrid solver. The results show that Q update generates difficult mazes tailored to the individual. Furthermore, it show that the quantum processing unit is more efficient at generating mazes than other solvers. Finally, we also present applications how our results could be used in the future.
ISSN:2624-9898
2624-9898
DOI:10.3389/fcomp.2023.1285962