The \((n^ 2-1)\)-puzzle and related relocation problems
type: Item
instance of: scholarly article
title: The \((n^ 2-1)\)-puzzle and related relocation problems
zbMATH Open document ID: 0704.68057
DOI: 10.1016/S0747-7171(08)80001-6
author: Daniel Ratner
author: Manfred K. Warmuth
published in: Journal of Symbolic Computation
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 03D15
Mathematics Subject Classification ID: 91A99
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 68U99
zbMATH DE Number: 4155895
zbMATH Keywords: heuristic search techniques
zbMATH Keywords: planar relocation problems
zbMATH Keywords: robotics
zbMATH Keywords: polynomial approximation algorithms
MaRDI profile type: Publication
Wikidata QID: Q56269529
cites work: Q3807647
cites work: Depth-first iterative-deepening: An optimal admissible tree search
cites work: Q5187226
cites work: Q5679703
cites work: The complexity of satisfiability problems
full work available at URL: s0747-7171(08)80001-6
OpenAlex ID: W2034604437
description: scientific article; zbMATH DE number 4155895