Skip to content

Latest commit

 

History

History
5 lines (4 loc) · 226 Bytes

README.md

File metadata and controls

5 lines (4 loc) · 226 Bytes

Dynamic programming axe sharpening

Quick n dirty implementation of a game which must find a goal on a grid however while having a velocity. In a nutshell it's just a pathfinding algorithm using BFS.

To run: go run *.go