Kiwiberry AI Search

A portfolio-ready visualization of an A* search solver that plans a constrained route through a 9x6 hex grid, collecting berries while respecting weight and volume limits.

A* search Hex grid planning Python algorithm

Optimal Route Playback

Watch the solver collect every berry and unload at stations when constraints require it.

Ready
Step 0: Start | Load 0.0kg