GitHub - AdityaTak77/Knight-Tour-by-Linked-list: Given a N*N board with the Knight placed on the first block of an empty board. Moving according to the rules of chess knight must visit each square exactly once. Print the order of each cell in which they are visited. The problem statement can be solved using linked list, stacks.

AdityaTak77 / Knight-Tour-by-Linked-list Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

Given a N*N board with the Knight placed on the first block of an empty board. Moving according to the rules of chess knight must visit each square exactly once. Print the order of each cell in which they are visited. The problem statement can be solved using linked list, stacks.