X-Git-Url: http://git.scottworley.com/slidingtile/blobdiff_plain/32688d85f745574d7bbf941985234458d2776cce..0e89d341b7be7fa1861892cbcb216bc188f02e60:/sliding_tile_lib.cc?ds=inline

diff --git a/sliding_tile_lib.cc b/sliding_tile_lib.cc
index a4d522e..6b42f28 100644
--- a/sliding_tile_lib.cc
+++ b/sliding_tile_lib.cc
@@ -1,8 +1,13 @@
 #include "sliding_tile_lib.h"
 
+#include <cstdlib>
 #include <istream>
+#include <memory>
+#include <ostream>
+#include <stdexcept>
+#include <vector>
 
-signed char adjacent[BOARD_SIZE][5] = {
+signed char Step::adjacent[BOARD_SIZE][5] = {
   1,   4,   -1,  -1,  -1,
   0,   2,   5,   -1,  -1,
   1,   3,   6,   -1,  -1,
@@ -21,6 +26,42 @@ signed char adjacent[BOARD_SIZE][5] = {
   11,  14,  -1,  -1,  -1,
 };
 
+bool Board::is_valid() const {
+  bool seen[BOARD_SIZE];
+  for (int i = 0; i < BOARD_SIZE; i++) {
+    seen[i] = false;
+  }
+
+  for (int i = 0; i < BOARD_SIZE; i++) {
+    if (board[i] < 0 || board[i] >= BOARD_SIZE || seen[board[i]]) {
+      return false;
+    }
+    seen[board[i]] = true;
+  }
+
+  // Redundant because pigeon-hole-principle, but check anyway
+  for (int i = 0; i < BOARD_SIZE; i++) {
+    if (!seen[i]) {
+      return false;
+    }
+  }
+
+  return true;
+}
+
+bool Board::operator==(const Board& o) const {
+  for (int i = 0; i < BOARD_SIZE; i++) {
+    if (board[i] != o.board[i]) {
+      return false;
+    }
+  }
+  return true;
+}
+
+bool Board::operator!=(const Board& o) const {
+  return !operator==(o);
+}
+
 std::istream& operator>>(std::istream& is, Board& board) {
   for (int i = 0; i < BOARD_SIZE; i++) {
     if (!is.good()) {
@@ -33,7 +74,78 @@ std::istream& operator>>(std::istream& is, Board& board) {
     }
     int numeric;
     is >> numeric;
-    board[i] = numeric;
+    board.board[i] = numeric;
+  }
+  if (!board.is_valid()) {
+    is.setstate(std::istream::failbit);
   }
   return is;
 }
+
+std::ostream& operator<<(std::ostream& os, const Board& board) {
+  for (int i = 0; i < BOARD_SIZE; i++) {
+    if (i > 0) {
+      os << " ";
+    }
+    os << int(board.board[i]);
+  }
+  return os;
+}
+
+signed char Board::hole() const {
+  for (int i = 0; i < BOARD_SIZE; i++) {
+    if (board[i] == 0) {
+      return i;
+    }
+  }
+  throw std::runtime_error("Board with no hole");
+}
+
+InvertedBoard Board::invert() const {
+  InvertedBoard inv;
+  for (int i = 0; i < BOARD_SIZE; i++) {
+    inv.pos[board[i]] = i;
+  }
+  return inv;
+}
+
+int Board::distance(const Board& o) const {
+  return distance(o.invert());
+}
+
+int Board::distance(const InvertedBoard& invo) const {
+  int dist = 0;
+  for (int i = 0; i < BOARD_SIZE; i++) {
+    dist += std::abs(i % BOARD_DIM - invo.pos[board[i]] % BOARD_DIM) +
+            std::abs(i / BOARD_DIM - invo.pos[board[i]] / BOARD_DIM);
+  }
+  return dist;
+}
+
+std::vector<Step*> Step::successors(std::shared_ptr<Step> shared_this) {
+  std::vector<Step*> suc;
+  signed char hole_pos = board.hole();
+  for (int i = 0; adjacent[hole_pos][i] > 0; i++) {
+    suc.emplace_back(new Step{board, shared_this});
+    std::swap(suc.back()->board.board[hole_pos], suc.back()->board.board[adjacent[hole_pos][i]]);
+  }
+  return suc;
+}
+
+std::ostream& operator<<(std::ostream& os, const Step& step) {
+  if (step.prev != nullptr) {
+    os << *step.prev;
+    signed char this_hole = step.board.hole();
+    signed char prev_hole = step.prev->board.hole();
+    os << int(step.board.board[prev_hole]) << " ";
+    switch (this_hole - prev_hole) {
+      case -1:         os << "right";    break;
+      case  1:         os << "left";     break;
+      case -BOARD_DIM: os << "down";     break;
+      case BOARD_DIM:  os << "up";       break;
+      default:         os << "somehow!"; break;
+    }
+    os << std::endl;
+  }
+  return os;
+}