Welcome to Experts Exchange

Add your voice to the tech community where 5M+ people, just like you, are talking about what matters.

  • Help others & share knowledge
  • Earn cash & points
  • Learn & ask questions
Solved

c++ knights tour

Posted on 1998-03-31
8
1,154 Views
Last Modified: 2012-06-21
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?
0
Comment
Question by:cart123
8 Comments
 
LVL 84

Expert Comment

by:ozo
ID: 1183980
Always taking the branch with the minimum number of moves seems to be a simple and effective search heuristic.
0
 

Author Comment

by:cart123
ID: 1183981
Edited text of question
0
 

Author Comment

by:cart123
ID: 1183982
Edited text of question
0
Free Tool: IP Lookup

Get more info about an IP address or domain name, such as organization, abuse contacts and geolocation.

One of a set of tools we are providing to everyone as a way of saying thank you for being a part of the community.

 
LVL 2

Expert Comment

by:Srw
ID: 1183983
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
 

Author Comment

by:cart123
ID: 1183984
give me some code
0
 
LVL 2

Expert Comment

by:Srw
ID: 1183985
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
 
LVL 2

Expert Comment

by:mitchell042997
ID: 1183986
Tee hee!  What university do you go to?  This was an assignment for a class called Data Structures I at my school.  :)
0
 
LVL 1

Accepted Solution

by:
issamwd earned 50 total points
ID: 1183987
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

Featured Post

Free Tool: Path Explorer

An intuitive utility to help find the CSS path to UI elements on a webpage. These paths are used frequently in a variety of front-end development and QA automation tasks.

One of a set of tools we're offering as a way of saying thank you for being a part of the community.

Question has a verified solution.

If you are experiencing a similar issue, please ask a related question

Errors will happen. It is a fact of life for the programmer. How and when errors are detected have a great impact on quality and cost of a product. It is better to detect errors at compile time, when possible and practical. Errors that make their wa…
Unlike C#, C++ doesn't have native support for sealing classes (so they cannot be sub-classed). At the cost of a virtual base class pointer it is possible to implement a pseudo sealing mechanism The trick is to virtually inherit from a base class…
The goal of the video will be to teach the user the concept of local variables and scope. An example of a locally defined variable will be given as well as an explanation of what scope is in C++. The local variable and concept of scope will be relat…
The viewer will learn how to user default arguments when defining functions. This method of defining functions will be contrasted with the non-default-argument of defining functions.

789 members asked questions and received personalized solutions in the past 7 days.

Join the community of 500,000 technology professionals and ask your questions.

Join & Ask a Question