Solving Generalized Polyomino Puzzles Using the Ising Model

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 embed...

Descripción completa

Detalles Bibliográficos
Autores principales: Takabatake, Kazuki, Yanagisawa, Keisuke, Akiyama, Yutaka
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2022
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8947422/
https://www.ncbi.nlm.nih.gov/pubmed/35327865
http://dx.doi.org/10.3390/e24030354

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8947422/
https://www.ncbi.nlm.nih.gov/pubmed/35327865
http://dx.doi.org/10.3390/e24030354

Ejemplares similares