Individual subject evaluated difficulty of adjustable mazes generated using quantum annealing

In this paper, 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 difficult mazes, we introduce...

Celý popis

Podrobná bibliografia

Vydané v:	arXiv.org
Hlavní autori:	Ishikawa, Yuto, Yoshihara, Takuma, Okamura, Keita, Ohzeki, Masayuki
Médium:	Paper
Jazyk:	English
Vydavateľské údaje:	Ithaca Cornell University Library, arXiv.org 10.11.2023
Predmet:	Algorithms Cost function Optimization
ISSN:	2331-8422
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!