c++ knights tour

what is the best way to code the knights tour ( recusively etc. )?
does any one have the code for the the next best move one?
cart123Asked:
Who is Participating?

[Product update] Infrastructure Analysis Tool is now available with Business Accounts.Learn More

x
I wear a lot of hats...

"The solutions and answers provided on Experts Exchange have been extremely helpful to me over the last few years. I wear a lot of hats - Developer, Database Administrator, Help Desk, etc., so I know a lot of things but not a lot about one thing. Experts Exchange gives me answers from people who do know a lot about one thing, in a easy to use platform." -Todd S.

ozoCommented:
Always taking the branch with the minimum number of moves seems to be a simple and effective search heuristic.
0
cart123Author Commented:
Edited text of question
0
cart123Author Commented:
Edited text of question
0
Introduction to R

R is considered the predominant language for data scientist and statisticians. Learn how to use R for your own data science projects.

SrwCommented:
It seems to me that the easiest way to write it would be recursively.  I'm sure you can do it iteratively too, but I'd think the recursive solution is more elegant.

As for finding the next *best* move, you'd need to do some looking ahead.  But, looking ahead is more or less what the recursive method does.

Although, just thinking about it, I would seem that if I was on move 5, and a possible move 6 would dead-end me, then move 5 was bad too.  If after the proposed move 6, there is no place to go, then given an alternate move 6, you would never be able to get back to the target square of the initial move 6, hence move 5 must be bad too.  Think about it a little, I don't see any flaws in this thought, maybe someone else does.
0
cart123Author Commented:
give me some code
0
SrwCommented:
The Knight's tour is a common problem often assigned in programming classes.  I doubt you'll find anybody here to write your class assignments for you.

They'll be happy to give general advice and discuss the merits of various algorithms, but you're on your own to write the program.

If you have a specific question about part of the program, or a question about recursion, ask away.  Everybody here is glad to answer those questions.
0
mitchell042997Commented:
Tee hee!  What university do you go to?  This was an assignment for a class called Data Structures I at my school.  :)
0
issamwdCommented:
The Knight's tour is solved using the "Back tracking algorithm ", this algorithm is a systematic , exhaustive search of the solution .
read the algorithm carfully & iplement it by C++
declaration of variables are left to your capabilities & knowledge in C++.
more information about back tracking algorithm are found in (design of algorithms) books
best wishes

Data representation:

chess board :    matrix ( h )
we need also a boolean value denoting the occupation of the board .

Algorithm (pseudocode):

const n = 8 ; /* size of board */
const nSqr = n * n ;

h = array [1..n ,1..n] of integers ; // int h[8,8]

function to be used :


void TryMove(i, x , y ,q) // i : integer records move number
                                   // x,y two dimentional array index
                                    // q : boolean variable
{
initialize selection of moves;
   repeat until ( move was successful or no more candidates)
       {
       set moves that was not successful // try all moves
       select next candidate move from a list contains next possible moves
       if candidate accepted then
                {
                record move  # i
                if reached the last move
                      set move was succesful
                else
                       {
                       TryMove(i+1 , v ,u , q2) // recursive
                        if not successful then
                                 erase move #i recorded
                        }
                }
   }
}  
       

 
0

Experts Exchange Solution brought to you by

Your issues matter to us.

Facing a tech roadblock? Get the help and guidance you need from experienced professionals who care. Ask your question anytime, anywhere, with no hassle.

Start your 7-day free trial
It's more than this solution.Get answers and train to solve all your tech problems - anytime, anywhere.Try it for free Edge Out The Competitionfor your dream job with proven skills and certifications.Get started today Stand Outas the employee with proven skills.Start learning today for free Move Your Career Forwardwith certification training in the latest technologies.Start your trial today
C++

From novice to tech pro — start learning today.