A characterization of achievable patterns of the MN-puzzle problem
From MaRDI portal
Publication:758220
DOI10.1007/BF02945315zbMath0724.68083MaRDI QIDQ758220
Publication date: 1990
Published in: Journal of Computer Science and Technology (Search for Journal in Brave)
Combinatorics in computer science (68R05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Cites Work
This page was built for publication: A characterization of achievable patterns of the MN-puzzle problem