八数码问题广度优先搜索+枚举判重

最新推荐文章于 2021-08-22 11:27:17 发布

five213ddking

最新推荐文章于 2021-08-22 11:27:17 发布

阅读量238

点赞数

文章标签： div string 存储

本文链接：https://blog.csdn.net/five213ddking/article/details/6636422

版权

const MaxN=500000;

type
  atp=record
    s:string;
    time:longint;
  end;

var
  que:array[0..MaxN] of atp;
  head,tail,x:longint;
  now:string;//存储进行操作后的字符串

procedure print;//判断是否找到了目标状态
begin
  if que[tail].s='123804765' then
     begin
       writeln(que[tail].time);
       halt;
     end;
end;

function judge:boolean;//用枚举查找是否在之前的状态中出现过
var i:longint;
begin
  for i:= 1 to tail do
     if que[i].s=now then exit(false);
  exit(true);
end;

begin
  head:=1; tail:=1;
  readln(que[head].s);
  que[head].time:=0;
  print;
  while head<=tail do
    begin
      x:=pos('0',que[head].s);//查找当前状态的空格位置，以进行操作

      if ( (x-1) div 3>0 ) then //空格可以向上移动
         begin
           now:=que[head].s;
           now[x]:=now[x-3];
           now[x-3]:='0';
           if judge then
              begin
                inc(tail);
                que[tail].s:=now;
                que[tail].time:=que[head].time+1;
                print;
              end;
         end;

      if ( (x-1) div 3<2 ) then //空格可以向下移动
         begin
           now:=que[head].s;
           now[x]:=now[x+3];
           now[x+3]:='0';
           if judge then
              begin
                inc(tail);
                que[tail].s:=now;
                que[tail].time:=que[head].time+1;
                print;
              end;
         end;

      if ( (x-1) mod 3>0 ) then //空格可以向左移动
         begin
           now:=que[head].s;
           now[x]:=now[x-1];
           now[x-1]:='0';
           if judge then
              begin
                inc(tail);
                que[tail].s:=now;
                que[tail].time:=que[head].time+1;
                print;
              end;
         end;

      if ( (x-1) mod 3<2 ) then //空格可以向右移动
         begin
           now:=que[head].s;
           now[x]:=now[x+1];
           now[x+1]:='0';
           if judge then
              begin
                inc(tail);
                que[tail].s:=now;
                que[tail].time:=que[head].time+1;
                print;
              end;
         end;
      Inc(head);
    end;
end.