Heuristic Search - 8 Puzzle(九宫格)（map判重+bfs）（康拓展开+bfs）

最新推荐文章于 2024-07-09 16:07:52 发布

肘子zhouzi

最新推荐文章于 2024-07-09 16:07:52 发布

阅读量822

点赞数

文章标签： jiu gong ge

本文链接：https://blog.csdn.net/zhouzi2018/article/details/80545278

版权

8 Puzzle

The goal of the 8 puzzle problem is to complete pieces on 3×3 cells where one of the cells is empty space.

In this problem, the space is represented by 0 and pieces are represented by integers from 1 to 8 as shown below.

1 3 0
4 2 5
7 8 6

You can move a piece toward the empty space at one step. Your goal is to make the pieces the following configuration in the shortest move (fewest steps).

1 2 3
4 5 6
7 8 0

Write a program which reads an initial state of the puzzle and prints the fewest steps to solve the puzzle.

Input

The 3×3 integers denoting the pieces or space are given.

Output

Print the fewest steps in a line.

Constraints

There is a solution.

Sample Input

1 3 0
4 2 5
7 8 6

Sample Output

这道题二维映射一维，使用bfs，重要在于判重，有个八数码的八境界，现在会使用map和康拓展开式判重

#include<bits/stdc++.h>

using namespace std;

#define b 3
#define n2 9

const int dx[4]={-1,0,1,0};
const int dy[4]={0,-1,0,1};
const char dir[4]={'u','l','d','r'};

struct puzzle{
    int f[n2];
    int space;
    string path;
    bool operator < (const puzzle &p)const {
        for(int i=0;i<n2;i++){
            if(f[i]==p.f[i]){
                continue;
            }
            return f[i]>p.f[i];
        }
        return false;
    }
};

bool istarget(puzzle p)
{
    for(int i=0;i<n2;i++){
        if(p.f[i]!=(i+1)){
            return false;
        }
    }
    return true;
}

string bfs(puzzle s)
{
    queue<puzzle>q;
    map<puzzle,bool>V;
    puzzle u,v;
    s.path="";
    q.push(s);
    V[s]=true;
    while(!q.empty()){
        u=q.front();
        q.pop();
        if(istarget(u)){
            return u.path;
        }
        int sx=u.space/b;
        int sy=u.space%b;
        for(int r=0;r<4;r++){
            int tx=sx+dx[r];
            int ty=sy+dy[r];
            if(tx<0||ty<0||tx>=b||ty>=b){
                continue;
            }
            v=u;
            v.space=tx*b+ty;
            swap(v.f[v.space],v.f[u.space]);
            if(!V[v]){
                V[v]=true;
                v.path+=dir[r];
                q.push(v);
            }
        }
    }
    return "unsolvable";
}

int main()
{
    puzzle in;
    for(int i=0;i<n2;i++){
        scanf("%d",&in.f[i]);
        if(in.f[i]==0){
            in.f[i]=n2;
            in.space=i;
        }
    }
    string ans=bfs(in);
    cout<<ans.size()<<endl;
    return 0;
}
/*
1 3 0
4 2 5
7 8 6
*/

还有一种判重方式为康拓展开式

康拓展开式+bfs