assign2 - Programming & Data Structures Assignment 2...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Programming & Data Structures Assignment 2 The Knights Tour Problem Given an initial empty chess board and a single knight piece, write a program that will determine if it is possible or not for the knight, once placed on an arbitrary square on the board by the user, to move to every square on the chess board such that it lands on each square only the once . If it is possible for the knight to move to every square on the board landing only the once on each square, then show the moves to the user, otherwise you should print out a message telling the user that it is not possible from the initial position that the knight is in. To help you out with this assignment, I have provided a gui package for you to use in displaying the chess board and the knight on the board. Have a look at the reverse side of the sheet for a description of methods available to you in this package and any other extra information. The package itself can be downloaded from the Programming & Data Structures website. Bonus Marks :
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 2

assign2 - Programming & Data Structures Assignment 2...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online