Knight traversal is a simulative program where a Knight visit all the squares of a M x N matrics without repeatation. The starting square of the Knight will be counted as a visited square. Then the Knight will start traversing until all the squares are visited or there is no way to visit all the squares. The movement of the Knight is same as the real Knight moves in Chess.
Here the user will only input the values of M and N. As an output, the user will get the whole traversal path of the Knight by co-ordinates in the order the Knight visited if the Knight can visit all the squares successfully, else will get an output that it is not possible, like that.
Suppose, if the user gives the value of M & N both as 3 then it is never possible to visit all the squares since the middle square can never be visited. So, in this case the value should be greater than 3. If the values are valid then the Knight will start traversing.
working of the program:
The Knight will first start with the square of the first row first column and will check all the possibilities of visiting all the squares. If it fails to do so, it will go to the next square of the same row and will again check like previous one and it will go on until all the squares are visited or all the squares are used up as a starting point (that means visiting all the squares is not possible). If the job is done then the user should get the output in co-ordinates. e.g.-> If the starting point happens to be at (1,0) then the user will get like this,
3. (5,2). etc, etc.....
7 freelancers estão ofertando em média $44 para este trabalho
I can do it very quickly. I've already thought about the logic and design. I can provide you all possible travarsal paths. Please read PM. Waiting for your response.
We can do this project for any amount you choose.. it is so simple !!. We can finish the program in a day... Please check PMB for more details... regards Harishyam