KNIGHT TOUR PROBLEM
- The Knight's Tour is a well-known problem in which a knight moves on an × chessboard in a manner that it visits each square exactly once.
- It’s movement adheres to the conventional rules of chess, where it moves in an L-shaped pattern: two squares in one direction and then one square perpendicular, or one square in one direction and then two squares perpendicular.
- The objective is to identify a sequence of moves, starting from a given position on the board, that enables the knight to visit every square precisely once, while staying within the boundaries of the chessboard.
Closing the presentation
- The solution can either be an open tour, where the knight doesn't need to conclude on the starting square, or a closed tour, where the knight ends up on a square that is one knight's move away from the starting square. The challenge lies in determining whether such a tour is feasible for a given × chessboard, and if it is, providing a possible sequence of moves that accomplishes this tour. In case no solution exists, an appropriate message should be displayed.
SUBMITTED BY :-
BHARTI KUMARI (1MV22CS041)
HARSHITH J (1MV22CS062)
DEEPANSHI TRIPATHI (1MV22CS055)
SUBJECT : ANALYSIS AND DESIGN OF ALGORITHM
SUBJECT CODE : BCS401
SUBJECT TEACHER : DR. SUMA SWAMY
- Summarize each point you made
- Give quick call-backs so your audience remembers
- Make it clear this is the end
Follow up with another point
Put a bold statement here
Put something fun or important here
Keep your words short and punchy so your audience stays focused. You can add imagery and frames to keep their attention where you want it.
Write something high-impact about this photo
Use this space for details that you haven’t talked about yet. Relate what you’re saying to the nearby image so your audience has a visual, too.