Design and implement a backtracking algorithm

Assignment Help Basic Computer Science

Reference no: EM131252753

Puzzle pegs This puzzle-like game is played on a board with 15 small holes arranged in an equilateral triangle. In an initial position, all but one of the holes are occupied by pegs, as in the example shown below. A legal move is a jump of a peg over its immediate neighbor into an empty square opposite; the jump removes the jumped-over neighbor from the board.

Design and implement a backtracking algorithm for solving the following versions of this puzzle.

a. Starting with a given location of the empty hole, find a shortest sequence of moves that eliminates 14 pegs with no limitations on the final position of the remaining peg.

b. Starting with a given location of the empty hole, find a shortest sequence of moves that eliminates 14 pegs with the remaining peg at the empty hole of the initial board.

Reference no: EM131252753

Questions Cloud

Describe the nonfunctional requirements : Include a short description of the function being supported, a detailed description of the requirements, and how they will be measured during testing. Describe the nonfunctional requirements, also known as attributes of the system addressing area..

Write a program implementing a backtracking algorithm : The general template for backtracking algorithms, which is given in the section, works correctly only if no solution is a prefix to another solution to the problem. Change the template's pseudocode to work correctly without this restriction.

Understand consumer behavior in order : Marketers need to recognize and understand consumer behavior in order for their business to be successful. List and explain why understanding consumer behavior is so important. This must include several examples. Also within your explanation show..

Is this measurement a positive or negative thing : Is this measurement a positive or negative thing? Does it bring people closer to or push them further from knowledge of themselves and/or others

Design and implement a backtracking algorithm : Starting with a given location of the empty hole, find a shortest sequence of moves that eliminates 14 pegs with no limitations on the final position of the remaining peg.

Determine that company strengths and weaknesses : "Internal Environment" Please respond to the following: CHOOSE A COMPANY you researched to determine that company's strengths and weaknesses. Be as specific as possible.

Describe the issue tell us why it is important : In this forum, propose a topic for discussion with the class. Describe the issue, tell us why it is important to you, perhaps give us some of your own thoughts about it, and pose some questions that you think will lead to useful discussion

What recommendations would you have for developing countries : Contrasting the lessons learned in the US and the UK what recommendations would you have for developing countries considering healthcare system implementations (note that you could strengthen your argument by comparing the US and UK systems to the..

How many nodes will be in the state-space tree : In the best case, how many nodes will be in the state-space tree of the branch-and-bound algorithm for the assignment problem?

User Account

All Pages