题目二 A*算法

题目二 A*算法

Node类

public class Node {
private int[][]nowState;
private int f;//价值
private int g;//层数
private Node parent;
public Node(int [][]nowState ,int g,Node parent){
this.nowState=nowState;
this.g=g;
this.parent=parent;
}
public int getF() {
return f;
}
public void setF(int h) {
this.f=h+g;
}
public int[][] getNowState() {
return nowState;
}
public void setNowState(int[][] nowState) {
this.nowState = nowState;
}
public Node getParent() {
return parent;
}
public void setParent(Node parent) {
this.parent = parent;
}
public int getG() {
return g;
}
public void setG(int g) {
this.g = g;
}
}

主类

import java.util.ArrayList;
import java.util.List;
public class Chess {
private Node start;
private Node end;
private List open = new ArrayList<>();
private List close = new ArrayList<>();
int x, y;
public Chess(int[][] start, int[][] end) {
this.start = new Node(start, 0, null);
this.end = new Node(end, 0, null);
}
/**
* 寻找起始状态与目标状态不同的格数
/
public int different(Node start, Node end) {
int count = 0;
for (int i = 0; i < start.getNowState().length; i++) {
for (int j = 0; j < start.getNowState()[i].length; j++) {
if (start.getNowState()[i][j] != end.getNowState()[i][j])
count++;
}
}
return count;
}
/*
* 是否相同
/
public boolean same(Node start, Node end) {
for (int i = 0; i < start.getNowState().length; i++) {
for (int j = 0; j < start.getNowState()[i].length; j++) {
if (start.getNowState()[i][j] != end.getNowState()[i][j])
return false;
}
}
return true;
}
/*
* 寻找九宫格中的空格
/
public void findBlank(Node start) {
for (int i = 0; i < start.getNowState().length; i++) {
for (int j = 0; j < start.getNowState()[i].length; j++) {
if (start.getNowState()[i][j] == 0) {
x = i;
y = j;
}
}
}
}
/*
* 是否在close表中
/
public boolean onClose(Node start) {
for (int i = 0; i < close.size(); i++) {
if (same(start, close.get(i)))
return true;
}
return false;
}
/*
* 对空格进行操作
/
public void move(Node start) {
Node q;
int[][] temp;
//上移
temp = new int[3][3];
for (int i = 0; i < start.getNowState().length; i++) {
for (int j = 0; j < start.getNowState()[i].length; j++) {
temp[i][j] = start.getNowState()[i][j];
}
}
findBlank(start);
if (x - 1 >= 0) {
int tmp = temp[x][y];
temp[x][y] = temp[x - 1][y];
temp[x - 1][y] = tmp;
q = new Node(temp, start.getG() + 1, start);
if (!onClose(q)) {
q.setF(different(q, end));
open.add(q);
}
}
//下移
temp = new int[3][3];
for (int i = 0; i < start.getNowState().length; i++) {
for (int j = 0; j < start.getNowState()[i].length; j++) {
temp[i][j] = start.getNowState()[i][j];
}
}
findBlank(start);
if (x + 1 <= 2) {
int tmp = temp[x][y];
temp[x][y] = temp[x + 1][y];
temp[x + 1][y] = tmp;
q = new Node(temp, start.getG() + 1, start);
if (!onClose(q)) {
q.setF(different(q, end));
open.add(q);
}
}
//左移
temp = new int[3][3];
for (int i = 0; i < start.getNowState().length; i++) {
for (int j = 0; j < start.getNowState()[i].length; j++) {
temp[i][j] = start.getNowState()[i][j];
}
}
findBlank(start);
if (y - 1 >= 0) {
int tmp = temp[x][y];
temp[x][y] = temp[x][y - 1];
temp[x][y - 1] = tmp;
q = new Node(temp, start.getG() + 1, start);
if (!onClose(q)) {
q.setF(different(q, end));
open.add(q);
}
}
//右移
temp = new int[3][3];
for (int i = 0; i < start.getNowState().length; i++) {
for (int j = 0; j < start.getNowState()[i].length; j++) {
temp[i][j] = start.getNowState()[i][j];
}
}
findBlank(start);
if (y + 1 <= 2) {
int tmp = temp[x][y];
temp[x][y] = temp[x][y + 1];
temp[x][y + 1] = tmp;
q = new Node(temp, start.getG() + 1, start);
if (!onClose(q)) {
q.setF(different(q, end));
open.add(q);
}
}
}
/*
* 找出最小f值
*
* @return
/
public Node findMin() {
Node p = open.get(0);
for (int i = 1; i < open.size(); i++) {
if (open.get(i).getF() < p.getF())
p = open.get(i);
}
return p;
}
/*
* 打印
*
* @param end
/
public void show(Node end) {
for (int i = 0; i < end.getNowState().length; i++) {
for (int j = 0; j < end.getNowState()[i].length; j++) {
System.out.print(end.getNowState()[i][j] + " ");
}
System.out.println();
}
}
/*
* 程序运行
*/
public void begin() {
open.add(start);
Node p = null;
while (open != null) {
p = findMin();
if (same(p, end))
break;
open.remove§;
close.add§;
move§;
}
if (same(p, end)) {
List answer = new ArrayList<>();
while (p.getParent() != null) {
answer.add§;
p = p.getParent();
}
System.out.println(“步骤：”);
for (int i = answer.size() - 1; i >= 0; i–) {
System.out.println(“第”+(answer.size() - i) + “步:”);
show(answer.get(i));
}
}
}

测试类

import java.util.Scanner;
public class Test {
public static void main(String[]args){
Scanner scanner=new Scanner(System.in);
System.out.println(“起始：”);
int [][]start=new int[3][3];
int [][]end=new int[3][3];
for(int i=0;i<3;i++)
for(int j=0;j<3;j++)
start[i][j]=scanner.nextInt();
System.out.println(“目标：”);
for(int i=0;i<3;i++)
for (int j = 0; j < 3; j++)
end[i][j]=scanner.nextInt();
Chess chess =new Chess(start,end);
chess.begin();
}
}