Skip to content

Latest commit

 

History

History
14 lines (9 loc) · 416 Bytes

README.md

File metadata and controls

14 lines (9 loc) · 416 Bytes

knightswatch

Problem: A knight piece is on an infinite chess board. Assuming the knight is positioned at (0,0) you are asked to calculate and print the shortest path that the knight can take to get to the target location.


A console application in C# is built to solve this problem.

Thanks!

Sovit