diff --git a/include/central64/grid/Array2D.hpp b/include/central64/grid/Array2D.hpp
index f3ddbff..b2f13f7 100644
--- a/include/central64/grid/Array2D.hpp
+++ b/include/central64/grid/Array2D.hpp
@@ -56,7 +56,7 @@ Array2D<T>::Array2D(Offset2D dims, const T& value)
 template <typename T>
 void Array2D<T>::Fill(const T& value)
 {
-    data_.assign(std::begin(data_), std::end(data_), value);
+    data_.assign(dims_.X()*dims_.Y(), value);
 }
 
 template <typename T>
diff --git a/include/central64/grid/Connections.hpp b/include/central64/grid/Connections.hpp
index f8260af..b5f50c1 100644
--- a/include/central64/grid/Connections.hpp
+++ b/include/central64/grid/Connections.hpp
@@ -11,7 +11,7 @@ template <int L>
 class Connections
 {
 public:
-    constexpr Connections() = default;  ///< Create a set of connections for which all moves are connected.
+    constexpr Connections() = default;  ///< Create a set of connections for which no moves are connected.
 
     constexpr bool IsConnected(const Move<L>& move) const { return bool(flags_ & (Unsigned<L>::unit << move.Index())); }  ///< Check whether the specified `move` is connected.
     constexpr bool IsAllConnected() const { return bool(flags_ == Unsigned<L>::max); }                                    ///< Check whether all moves are connected.
diff --git a/include/central64/search/PathTree.hpp b/include/central64/search/PathTree.hpp
index 0117336..a5ceafc 100644
--- a/include/central64/search/PathTree.hpp
+++ b/include/central64/search/PathTree.hpp
@@ -65,7 +65,7 @@ class PathTree
         uint64_t searchID{ 0 };     // The ID of the search for which the node was last initialized.
         PathCost gCost{};           // The grid-based distance to the source.
         PathCost hCost{};           // The heuristic or estimated distance to the sample.
-        int64_t parentMoveIndex{};  // The index of the parent move.
+        int parentMoveIndex{};      // The index of the parent move.
     };
 
     const Grid2D<L>* gridPtr_;