Skip to content

Latest commit

 

History

History
5 lines (4 loc) · 297 Bytes

README.md

File metadata and controls

5 lines (4 loc) · 297 Bytes

Path-Finding

A grid of n x n size with generated numbers that goes from a starting number to a target number. The program would access the fastest path to the target number in a given amount of turns or less. With restrictions the path can’t reach repeating numbers and as well as diagonals.