inital classes

Author: proton

week4/priority-queues/assignment-8-puzzle/Board.java

@@ -0,0 +1,54 @@
+public class Board {
+  int[][] tiles;
+
+  // create a board from an n-by-n array of tiles,
+  // where tiles[row][col] = tile at (row, col)
+  public Board(int[][] tiles) {
+    this.tiles = tiles;
+  }
+
+  // string representation of this board
+  public String toString() {
+    return "";
+  }
+
+  // board dimension n
+  public int dimension() {
+    return tiles.length;
+  }
+
+  // number of tiles out of place
+  public int hamming() {
+    return 0;
+  }
+
+  // sum of Manhattan distances between tiles and goal
+  public int manhattan() {
+    return 0;
+  }
+
+  // is this board the goal board?
+  public boolean isGoal() {
+    return false;
+  }
+
+  // does this board equal y?
+  public boolean equals(Object y) {
+    return false;
+  }
+
+  // all neighboring boards
+  public Iterable<Board> neighbors() {
+    return null;
+  }
+
+  // a board that is obtained by exchanging any pair of tiles
+  public Board twin() {
+    return null;
+  }
+
+  // unit testing (not graded)
+  public static void main(String[] args) {
+    //
+  }
+}

week4/priority-queues/assignment-8-puzzle/Solver.java

@@ -0,0 +1,56 @@
+import edu.princeton.cs.algs4.In;
+import edu.princeton.cs.algs4.StdOut;
+
+public class Solver {
+  // find a solution to the initial board (using the A* algorithm)
+  public Solver(Board initial) {
+    if (initial == null) {
+      throw new IllegalArgumentException("initial argument to Solver constructor is null");
+    }
+  }
+
+  // is the initial board solvable? (see below)
+  public boolean isSolvable() {
+    return false;
+  }
+
+  // min number of moves to solve initial board; -1 if unsolvable
+  public int moves() {
+    // Return -1 in moves() if the board is unsolvable.
+    return -1;
+  }
+
+  // sequence of boards in a shortest solution; null if unsolvable
+  public Iterable<Board> solution() {
+    // Return null in solution() if the board is unsolvable.
+    return null;
+  }
+
+  // test client (see below)
+  public static void main(String[] args) {
+    // create initial board from file
+    In in = new In(args[0]);
+    int n = in.readInt();
+    int[][] tiles = new int[n][n];
+    for (int i = 0; i < n; i++)
+        for (int j = 0; j < n; j++)
+            tiles[i][j] = in.readInt();
+
+    Board initial = new Board(tiles);
+
+    // solve the puzzle
+    Solver solver = new Solver(initial);
+
+    // print solution to standard output
+    if (!solver.isSolvable()) {
+      StdOut.println("No solution possible");
+    }
+    else {
+      StdOut.println("Minimum number of moves = " + solver.moves());
+      for (Board board : solver.solution()) {
+        StdOut.println(board);
+      }
+    }
+  }
+
+}

week4/priority-queues/assignment-8-puzzle/puzzle04.txt

@@ -0,0 +1,3 @@
+ 0  1  3
+ 4  2  5
+ 7  8  6