A算法求解八数码问题（C++实现）
好的用c语言实现八数码问题的宽度优先搜索114信息网MIP移动站，下面是A*算法求解8数码问题的Java代码：``` java.util.;import java.util.;import java.util.HashSet;import java.util.;public class {private static int[][] goal = {{1, 2, 3}, {4, 5, 6}, {7, 8, 0}}; // 目标状态private int[][] state; // 当前状态public (int[][] state) {this.state = state;}public boolean isGoal() { // 判断是否达到目标状态for (int i = 0; i < 3; i++) {for (int j = 0; j < 3; j++) {if (state[i][j] != goal[i][j])return false;}}return true;}public () { // 获取所有可能的下一步状态 = new ();int x = 0, y = 0;for (int i = 0; i < 3; i++) {for (int j = 0; j < 3; j++) {if (state[i][j] == 0) {x = i;y = j;break;}}}if (x > 0) { // 向上移动int[][] = new int[3][3];for (int i = 0; i < 3; i++) {for (int j = 0; j < 3; j++) {[i][j] = state[i][j];}}[x][y] = [x - 1][y];[x - 1][y] = 0;.add(new ());}if (x < 2) { // 向下移动int[][] = new int[3][3];for (int i = 0; i < 3; i++) {for (int j = 0; j < 3; j++) {[i][j] = state[i][j];}}[x][y] = [x + 1][y];[x + 1][y] = 0;.add(new ());}if (y > 0) { // 向左移动int[][] = new int[3][3];for (int i = 0; i < 3; i++) {for (int j = 0; j < 3; j++) {[i][j] = state[i][j];}}[x][y] = [x][y - 1];[x][y - 1] = 0;.add(new ());}if (y < 2) { // 向右移动int[][] = new int[3][3];for (int i = 0; i < 3; i++) {for (int j = 0; j < 3; j++) {[i][j] = state[i][j];}}[x][y] = [x][y + 1];[x][y + 1] = 0;.add(new ());}return ;}public int () { // 估价函数int count = 0;for (int i = 0; i < 3; i++) {for (int j = 0; j < 3; j++) {if (state[i][j] != 0 && state[i][j] != goal[i][j]) {int x = (state[i][j] - 1) / 3;int y = (state[i][j] - 1) % 3;count += Math.abs(x - i) + Math.abs(y - j);}}}return count;}public static void main(String[] args) {int[][] = {{2, 8, 3}, {1, 6, 4}, {7, 0, 5}}; // 初始状态 puzzle = new (); queue = new ((::));HashSet visited = new HashSet();queue.add(puzzle);visited.add(puzzle);while (!queue.isEmpty()) { current = queue.poll();if (current.isGoal()) {System.out.println("找到解！");return;} = current.();for ( : ) {if (!visited.()) {queue.add();visited.add();}}}System.out.println("无解！");}}```代码中的``类表示8数码问题中的一个状态，包含当前状态的二维数组`state`、判断是否达到目标状态的方法`isGoal()`、获取所有可能的下一步状态的方法`()`、估价函数`()`等。主函数中使用了A*算法求解8数码问题用c语言实现八数码问题的宽度优先搜索A算法求解八数码问题（C++实现）b2b，使用了优先队列和哈希集合分别存储待扩展的状态和已经访问过的状态。
【本文来源于互联网转载，如侵犯您的权益或不适传播，请邮件通知我们删除】