Advertisement

08.15.2008 at 11:26PM PDT, ID: 23653148
[x]
Attachment Details
[x]
The Solution Rating System

With so many solutions, how can you tell which solutions are most likely to help you and which ones are not? To provide you with a tool to use, we rate our solutions based on various elements that most accurately determine if a solution is a quality solution. To explain what factors affect the solution rating, here are the elements we take into consideration when formulating our solution rating.

  • The Grade of the Solution
  • The Zone Rank of the Expert Providing the Solution
  • The Number of Author and Expert Comments
  • The Number of Experts Contributing
  • The Feedback of the Community

Your Input Matters
Because of the way the system is set up, the most important variable in this equation is you. As a member of Experts Exchange, you are able to cast your vote on the quality of the solutions in regard to how complete, accurate, helpful and easy to understand each solution is. When you provide your feedback, each rating is adjusted accordingly. So, if you see a solution that has a poor rating that you think is a good solution, let us know by rating it. As you do, the rating will be adjusted and will become more accurate for other members of our site.

If you have any suggestions that you would like to make for our rating system, please ask a question in the Suggestions Zone of Community Support.

Thank you!

9.4

complicated question for math/algorithmm geniuses - moves on chess board

Asked by codeQuantum in Algorithms, Math & Science, Puzzles & Riddles

Hi experts,

Here is the problem (i am coding a software and this is a problem i have to solve to come up with an algorithm)

You have a 12x12 chess-like board, except that black and white cases are shuffled, they are do not alternate in a previsible way like in a regular chess board. It is completely random, however we know their position. you start at a random position, and you have to move 1 case at a time in one of four directions : north, south, west, or east.

The problem : you have a limited number of moves X, and you have to move around and come back to your starting position by going through the best route. the best route being defined as passing through a MAXIMUM of black cases (stay away from white ones).

This is a software programming problem i have been wrestling with for some time but with no success. I feel I am missing a math component to find a breakthrough to a solution.

I would appreciate ideas, or maybe links to chess-board specific math formulas or theories to deal with this kind of problems. I am really desperate and I am looking for anything that could let me move forward with this.Start Free Trial
[+][-]08.15.2008 at 11:45PM PDT, ID: 22243360

View this solution now by starting your 7-day free trial. Setting up your free trial is quick, easy, and secure. We will return you to this solution, unlocked, when you're done.

 

About this solution

Zones: Algorithms, Math & Science, Puzzles & Riddles
Sign Up Now!
Solution Provided By: Infinity08
Participating Experts: 3
Solution Grade: A
 
 
[+][-]08.16.2008 at 01:15AM PDT, ID: 22243486

Often, when Experts are collaborating with members who have asked questions, they will request additional information about the problem. Askers respond with an author comment like this one.

Start your 7-day free trial to view this Author Comment or ask the Experts your question.

 
[+][-]09.25.2008 at 02:39PM PDT, ID: 22574151

Assisted solutions are selected by the member who asked the question as a comment that contributed to their question's solution.

Start your 7-day free trial to view this Assisted Solution or ask the Experts your question.

 
[+][-]10.23.2008 at 06:01AM PDT, ID: 22785568

Assisted solutions are selected by the member who asked the question as a comment that contributed to their question's solution.

Start your 7-day free trial to view this Assisted Solution or ask the Experts your question.

 
 
Loading Advertisement...
20080716-EE-VQP-32 / EE_QW_EXPERT_20070906