Assignment 4 | 8puzzle | Princeton Algorithms

芝士蓝莓派

于 2020-07-07 11:36:24 发布

阅读量273

点赞数

分类专栏： Princeton

本文链接：https://blog.csdn.net/qq_46497008/article/details/107175225

版权

这篇博客详细介绍了8 Puzzle问题的解决方案，包括Board.java和Solver.java的实现。任务要求遵循特定规格，特别是Board.java的twin()方法。Solver.java的核心在于处理isSolvable，通过双优先级队列分别搜索初始和其twin的状态树，直至找到解决方案。同时，博主提醒注意减少MinPQ方法的调用以优化性能，并强调equals方法的使用限制。

摘要由CSDN通过智能技术生成

Correctness:  51/51 tests passed
Memory:       22/22 tests passed
Timing:       125/125 tests passed

Aggregate score: 100.00%

1. 任务

Specification

2. Board.java

import edu.princeton.cs.algs4.In;

import java.util.ArrayList;
import java.util.Arrays;

public class Board {
   
    private final int[][] board;
    private final int n;

    // create a board from an n-by-n array of tiles,
    // where tiles[row][col] = tile at (row, col)
    public Board(int[][] tiles) {
   
        board = new int[tiles.length][tiles.length];
        n = tiles.length;
        for (int i = 0; i < n; i++)
            for (int j = 0; j < n; j++)
                board[i][j] = tiles[i][j];
    }

    // string representation of this board
    public String toString() {
   
        StringBuilder s = new StringBuilder();
        s.append(board.length + "\n");
        for (int i = 0; i < board.length; i++) {
   
            for (int j = 0; j < board.length; j++)
                s.append(String.format("%2d ", board[i][j]));
            s.append("\n");
        }
        return s.toString();
    }

    // board dimension n
    public int dimension() {
   
        return n;
    }

    private int getIndex(int row, int col) {
   
        return row * n + col + 1;
    }

    // number of tiles out of place
    public int hamming() {
   
        int ham = 0;
        for (int i = 0; i < n; i++) {
   
            for (int j = 0; j < n; j++) {
   
                if (getIndex(i, j) == n * n)
                    break;
                if (board[i][j] != getIndex(i, j))
                    ham++;
            }
        }
        return ham;
    }

    // sum of Manhattan distances between tiles and goal
    public int manhattan() {
   
        int manh = 0;
        for (int i = 0; i < n; i++) {
   
            for (int j = 0; j < n; j++) {
   
                if (board[i][j] == 0) {
   
                    continue;
                }
                int row = (board[i