Next Article in Journal
When Is a Genuine Multipartite Entanglement Measure Monogamous?
Next Article in Special Issue
2D Ising Model for Enantiomer Adsorption on Achiral Surfaces: L- and D-Aspartic Acid on Cu(111)
Previous Article in Journal
Non-Markovian Quantum Dynamics in a Squeezed Reservoir
Previous Article in Special Issue
Analytical Expressions for Ising Models on High Dimensional Lattices
 
 
Article

Solving Generalized Polyomino Puzzles Using the Ising Model

Department of Computer Science, School of Computing, Tokyo Institute of Technology, Meguro-ku 152-8550, Tokyo, Japan
*
Author to whom correspondence should be addressed.
Academic Editors: Antonio M. Scarfone and Adam Lipowski
Entropy 2022, 24(3), 354; https://doi.org/10.3390/e24030354
Received: 5 January 2022 / Revised: 17 February 2022 / Accepted: 26 February 2022 / Published: 28 February 2022
(This article belongs to the Special Issue Ising Model: Recent Developments and Exotic Applications)
In the polyomino puzzle, the aim is to fill a finite space using several polyomino pieces with no overlaps or blanks. Because it is an NP-complete combinatorial optimization problem, various probabilistic and approximated approaches have been applied to find solutions. Several previous studies embedded the polyomino puzzle in a QUBO problem, where the original objective function and constraints are transformed into the Hamiltonian function of the simulated Ising model. A solution to the puzzle is obtained by searching for a ground state of Hamiltonian by simulating the dynamics of the multiple-spin system. However, previous methods could solve only tiny polyomino puzzles considering a few combinations because their Hamiltonian designs were not efficient. We propose an improved Hamiltonian design that introduces new constraints and guiding terms to weakly encourage favorable spins and pairs in the early stages of computation. The proposed model solves the pentomino puzzle represented by approximately 2000 spins with >90% probability. Additionally, we extended the method to a generalized problem where each polyomino piece could be used zero or more times and solved it with approximately 100% probability. The proposed method also appeared to be effective for the 3D polycube puzzle, which is similar to applications in fragment-based drug discovery. View Full-Text
Keywords: Ising model; polyomino puzzle; Hopfield neural network; combinatorial optimization Ising model; polyomino puzzle; Hopfield neural network; combinatorial optimization
Show Figures

Figure 1

MDPI and ACS Style

Takabatake, K.; Yanagisawa, K.; Akiyama, Y. Solving Generalized Polyomino Puzzles Using the Ising Model. Entropy 2022, 24, 354. https://doi.org/10.3390/e24030354

AMA Style

Takabatake K, Yanagisawa K, Akiyama Y. Solving Generalized Polyomino Puzzles Using the Ising Model. Entropy. 2022; 24(3):354. https://doi.org/10.3390/e24030354

Chicago/Turabian Style

Takabatake, Kazuki, Keisuke Yanagisawa, and Yutaka Akiyama. 2022. "Solving Generalized Polyomino Puzzles Using the Ising Model" Entropy 24, no. 3: 354. https://doi.org/10.3390/e24030354

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop