write knight tour problem which is present in datastructure
- 1 Answers
- 2782 Views
- I also Faced
- E-Mail Answers
Answer Posted / Sonu Verma
In the Knight's Tour problem within data structures, the goal is to move a knight (represented as a chess piece) on an NxN chessboard so that it visits each square exactly once and returns to its starting position. A knight moves two squares in one direction (horizontally or vertically) and then one square perpendicular to that direction.
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
Please Help Members By Posting Answers For Below Questions
