LAB 01 / Algorithms / Logistics

Route Craft

Compare informed, uninformed, bidirectional and fewest-step searches on the same weighted grid.

Interactive edition 1.2

Warehouse canvas

4-way / optional diagonals

FloorWallCost 3 / 6ExploredRoute

Draw walls by dragging. S and G are start and goal.

Run the experiment

Allow diagonals (no corner cutting)

Animate search

Animation cells / frame

Measured on this map

Algorithm	Cost	Expanded	Browser time
A*	—	—	—
Dijkstra	—	—	—
Bidirectional	—	—	—
BFS	—	—	—

A* uses Manhattan distance for 4-way movement and Chebyshev distance when diagonals are enabled. Both are admissible because the minimum entry cost is 1. Browser timing is illustrative, not a benchmark.

Keep your map

Import map (max 50 KB)

Algorithm contract

Walkable entry costs are 1, 3 or 6; the starting cell costs zero. Diagonals, when enabled, have the same entry-cost rule and cannot cut through blocked orthogonal corners. BFS ignores weights while selecting a route.