Mathematical characterizations and computational complexity of anti-slide puzzles
From MaRDI portal
Publication:5918568
DOI10.1016/j.tcs.2022.10.026zbMath1498.68359OpenAlexW4308483689MaRDI QIDQ5918568
Ko Minamisawa, Masao Hara, Ryuhei Uehara
Publication date: 17 November 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.10.026
Analysis of algorithms and problem complexity (68Q25) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Polyominoes (05B50)
Cites Work
This page was built for publication: Mathematical characterizations and computational complexity of anti-slide puzzles