Eight
Time Limit: 1000MS Memory Limit: 65536K
Description
The 15-puzzle has been around for over 100 years; even if you don’t know it by that name, you’ve seen it. It is constructed with 15 sliding tiles, each with a number from 1 to 15 on it, and all packed into a 4 by 4 frame with one tile missing. Let’s call the missing tile ‘x’; the object of the puzzle is to arrange the tiles so that they are ordered as:
1 2 3 4
5 6 7 8
9 10 11 12
13 14 15 x
where the only legal operation is to exchange ‘x’ with one of the tiles with which it shares an edge. As an example, the following sequence of moves solves a slightly scrambled puzzle:
1 2 3 4 1 2 3 4 1 2 3 4 1 2 3 4
5 6 7 8 5 6 7 8 5 6 7 8 5 6 7 8
9 x 10 12 9 10 x 12 9 10 11 12 9 10 11 12
13 14 11 15 13 14 11 15 13 14 x 15 13 14 15 x
r-> d-> r->
The letters in the previous row indicate which neighbor of the ‘x’ tile is swapped with the ‘x’ tile at each step; legal values are ‘r’,‘l’,‘u’ and ‘d’, for right, left, up, and down, respectively.
Not all puzzles can be solved; in 1870, a man named Sam Loyd was famous for distributing an unsolvable version of the puzzle, and
frustrating many people. In fact, all you have to do to make a regular puzzle into an unsolvable one is to swap two tiles (not counting the missing ‘x’ tile, of course).
In this problem, you will write a program for solving the less well-known 8-puzzle, composed of tiles on a three by three
arrangement.
Input
You will receive a description of a configuration of the 8 puzzle. The description is just a list of the tiles in their initial positions, with the rows listed from top to bottom, and the tiles listed from left to right within a row, where the tiles are represented by numbers 1 to 8, plus ‘x’. For example, this puzzle
1 2 3
x 4 6
7 5 8
is described by this list:
1 2 3 x 4 6 7 5 8
Output
You will print to standard output either the word ``unsolvable’’, if the puzzle has no solution, or a string consisting entirely of the letters ‘r’, ‘l’, ‘u’ and ‘d’ that describes a series of moves that produce a solution. The string should include no spaces and start at the beginning of the line.
Sample Input
2 3 4 1 5 x 7 6 8
Sample Output
ullddrurdllurdruldr
思路:
八数码问题,可以直接进行正向搜索配合康托展开。
#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <queue>
#include <string>
using namespace std;
const int maxn = 370000;
int fac[20] = {1, 1, 2, 6, 24, 120, 720, 5040, 40320, 362280};
int aim = 46234;
char indexs[5] = "udlr";
int Next[4][2] = {-1, 0, 1, 0, 0, -1, 0, 1};
string path;
bool book[maxn];
struct NODE {
int s[10];
string path;
int status;
int loc;
};
int cantor(int *a) {
int sum = 0;
for (int i = 0; i < 9; i++) {
int num = 0;
for (int j = i + 1; j < 9; j++) {
if (a[i] > a[j]) num++;
}
sum += (num * fac[9 - i - 1]);
}
return sum + 1;
}
bool bfs(int *a) {
memset(book, false, sizeof(book));
NODE cur, nextn;
queue<NODE> q;
int k = 0;
for (int i = 0; i < 9; i++) {
if (a[i] == 0) k = i;
cur.s[i] = a[i];
}
cur.status = cantor(cur.s);
cur.loc = k;
cur.path = "";
q.push(cur);
while (!q.empty()) {
cur = q.front();
q.pop();
if (cur.status == aim) {
path = cur.path;
return true;
}
int x = cur.loc / 3;
int y = cur.loc % 3;
for (int i = 0; i < 4; i++) {
int tx = x + Next[i][0];
int ty = y + Next[i][1];
if (tx < 0 || tx > 2 || ty < 0 || ty > 2) continue;
nextn = cur;
nextn.loc = tx *3 + ty;
nextn.s[cur.loc] = nextn.s[nextn.loc];
nextn.s[nextn.loc] = 0;
nextn.status = cantor(nextn.s);
if (book[nextn.status] == false) {
book[nextn.status] = true;
nextn.path = cur.path + indexs[i];
q.push(nextn);
}
}
}
return false;
}
int main() {
ios::sync_with_stdio(false);
int a[20];
char ch;
while (cin >> ch) {
if (ch == 'x') a[0] = 0;
else a[0] = ch - '0';
for (int i = 1; i < 9; i++) {
cin >> ch;
if (ch == 'x') a[i] = 0;
else a[i] = ch - '0';
}
if (bfs(a)) cout << path << endl;
else cout << "unsolvable" << endl;
}
return 0;
}