八数码问题源代码.docVIP

自己用宽度优先算法写的八数码问题，有代码，有注释，有截图 中间动态变化过程截图省略 …… 源代码： EightDigital.java package eightDigitalProblem; import java.util.*; public class EightDigital { public static void main(String[] args) { // TODO Auto-generated method stub //EightDigital ed = new EightDigital(); //ed.launch(); MyFrame mf = new MyFrame(); mf.launchMyFrame(); } public Node launch(int [] startData, int [] endData){ //起始结点赋值 283164705 //结束结点赋值 123804765 int[] array0 = new int[9]; Node s0 = new Node(array0); Node s = new Node(startData); s.setDepth(0); s.setStep(0); s.setFatherNode(s0); LinkedListNode open = new LinkedListNode(); //open集合 open.add(s); //添加初始点 LinkedListNode closed = new LinkedListNode(); //closed集合 Node n; while(true){ //循环 if(open.isEmpty()){ System.out.println(fail); System.exit(0); } n = open.getFirst(); if(goal(n, endData)){ System.out.println(success); //找到目标结点了 break; } closed.add(n); //把结点加入到closed表中 open.removeFirst(); //删除最前面的结点 LinkedListNode m = expand(n); //扩展结点 while(!m.isEmpty()){ open.add(m.removeFirst()); } } //找到目标结点 n.display(); return n; } public boolean goal(Node n, int [] endData){ int[] array = new int[9]; //目标结点赋初值 array[0] = 1; array[1] = 2; array[2] = 3; array[3] = 8; array[4] = 0; array[5] = 4; array[6] = 7; array[7] = 6; array[8] = 5; //Node s = new Node(array); //目标结点 Node s = new Node(endData); //目标结点 if(s.equals(n)){ return true; }else{ return false; } } public LinkedListNode expand(Node n){ //n结点向外扩展，返回扩展的结点集合 LinkedListNode temp = new LinkedListNode(); int zeroPosition = n.getZeroPosition(n); //记录0(空格)的位置 if(rightMove(zeroPosition)){ //空格可以向右移动 Node newNode = new Node(n); //创造一个新结点 newNode.getArray()[zeroPosition] = newNode.getArray()[zeroPosition+1]; //空格右移 newNode.getArray()[zeroPosition+1] = 0; if( !n.getFatherNode().equal