Abstract This project explores algorithmic and heuristic techniques of pathfinding by programming a Lego Mindstorms NXT Robot using the Not Exactly C(NXC)
