A real-time algorithm for the \((n^{2}-1)\)-puzzle
type: Item
instance of: scholarly article
title: A real-time algorithm for the \((n^{2}-1)\)-puzzle
zbMATH Open document ID: 0875.68539
DOI: 10.1016/0020-0190(95)00134-X
author: Ian Parberry
published in: Information Processing Letters
publication date: 1997-02-27T00:00:00Z
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 983944
zbMATH Keywords: Analysis of algorithms
zbMATH Keywords: 15-puzzle
zbMATH Keywords: \((n^{2}-1)\)-puzzle
zbMATH Keywords: Greedy algorithm
zbMATH Keywords: Divide and conquer
zbMATH Keywords: Real-time algorithm
zbMATH Keywords: Lower bound
zbMATH Keywords: Manhattan distance
MaRDI profile type: Publication
cites work: Fast probabilistic algorithms for Hamiltonian circuits and matchings
cites work: Depth-first iterative-deepening: An optimal admissible tree search
cites work: Q5611411
cites work: The \((n^ 2-1)\)-puzzle and related relocation problems
cites work: A Scheme for Fast Parallel Communication
full work available at URL: 0020-0190(95)00134-x
OpenAlex ID: W1989991251
description: scientific article; zbMATH DE number 983944