Place start and end markers on the 16x16 grid. BDH computes the optimal path using sparse Hebbian activations and dual-stream memory with O(T) inference.