Finding the shortest path in the shortest time using PCNN's
H. John Caulfield, Jason M. Kinser · IEEE Transactions on Neural Networks · 1999
A pulse coupled neural network (PCNN) can run mazes nondeterministically (taking all possible paths) with constant time per step. Thus, when a signal emerges, it has taken the shortest path in the shortest time.