DOIAbstract
It is shown that the greedy algorithm for the ((n^2-1))-puzzle makes (tfrac{8}{3}n^3 +O(n^2)) expected moves. This analysis is verified experimentally on 10,000 random instances each of the ((n^2-1))-puzzle for (4 leq n leq 200)
It is shown that the greedy algorithm for the ((n^2-1))-puzzle makes (tfrac{8}{3}n^3 +O(n^2)) expected moves. This analysis is verified experimentally on 10,000 random instances each of the ((n^2-1))-puzzle for (4 leq n leq 200)
A 2-matching of a graph G is a spanning subgraph with maximum degree two. The size of a 2-matching U...
<p>The random greedy algorithm for constructing a large partial Steiner-Triple-System is defined as ...
When analyzing the computational complexity of well-known puzzles, most papers consider the algorith...
In this article, it is shown that the greedy algorithm for the (n² - 1)-puzzle makes 8/3 + O(n²) exp...
[[abstract]]The (n2-1)-puzzle has been studied by many researchers since Sam Loyd introduced the “14...
The 8-puzzle and the 15-puzzle have been used for many years as a domain for testing heuristic searc...
AbstractA family of completely unimodal pseudo-Boolean functions is constructed inductively over the...
The 8-puzzle is a classic problem in the real world. It involves swapping a tile's position with an ...
© 2018 Elsevier B.V. The 15 puzzle is a classic reconfiguration puzzle with fifteen uniquely labeled...
In this paper, an analysis of the 4-(N2-1) Puzzle, which is a generalization of the (N2-1) Puzzle, i...
Title: Sub-optimal algorithms for solving sliding puzzles Author: Petr Michalík Department: Departme...
This paper compares the performance of popular AI techniques, namely the Breadth First Search, Depth...
In this paper, an analysis of the 4-(N2-1) Puzzle, which is a generalization of the (N2-1) Puzzle, i...
This paper compares the performance of popular AI techniques, namely the Breadth First Search, Depth...
Includes bibliographical references (pages 42-42)The natural generalization of the Instant Insanity ...
A 2-matching of a graph G is a spanning subgraph with maximum degree two. The size of a 2-matching U...
<p>The random greedy algorithm for constructing a large partial Steiner-Triple-System is defined as ...
When analyzing the computational complexity of well-known puzzles, most papers consider the algorith...
In this article, it is shown that the greedy algorithm for the (n² - 1)-puzzle makes 8/3 + O(n²) exp...
[[abstract]]The (n2-1)-puzzle has been studied by many researchers since Sam Loyd introduced the “14...
The 8-puzzle and the 15-puzzle have been used for many years as a domain for testing heuristic searc...
AbstractA family of completely unimodal pseudo-Boolean functions is constructed inductively over the...
The 8-puzzle is a classic problem in the real world. It involves swapping a tile's position with an ...
© 2018 Elsevier B.V. The 15 puzzle is a classic reconfiguration puzzle with fifteen uniquely labeled...
In this paper, an analysis of the 4-(N2-1) Puzzle, which is a generalization of the (N2-1) Puzzle, i...
Title: Sub-optimal algorithms for solving sliding puzzles Author: Petr Michalík Department: Departme...
This paper compares the performance of popular AI techniques, namely the Breadth First Search, Depth...
In this paper, an analysis of the 4-(N2-1) Puzzle, which is a generalization of the (N2-1) Puzzle, i...
This paper compares the performance of popular AI techniques, namely the Breadth First Search, Depth...
Includes bibliographical references (pages 42-42)The natural generalization of the Instant Insanity ...
A 2-matching of a graph G is a spanning subgraph with maximum degree two. The size of a 2-matching U...
<p>The random greedy algorithm for constructing a large partial Steiner-Triple-System is defined as ...
When analyzing the computational complexity of well-known puzzles, most papers consider the algorith...
Add to ORKG