Backtracking

Nov 29, 2012

210 likes | 412 Views

2. Backtracking. Suppose you have to make a series of decisions, among various choices, whereYou don't have enough information to know what to chooseEach decision leads to a new set of choicesSome sequence of choices (possibly more than one) may be a solution to your problemBacktracking is a met

Share Presentation

Embed Code

Link

terrian

Download Presentation

Backtracking

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

Backtracking

Backtracking. General Concepts. Algorithm strategy Approach to solving a problem May combine several approaches Algorithm structure Iterative  execute action in loop Recursive  reapply action to subproblem(s) Problem type Satisfying  find any satisfactory solution

1.44k views • 25 slides

Backtracking

Backtracking. What is backtracking? General structure of Backtracking algorithms Backtracking and Recursion. Backtracking. Problem: Find out all 3-bit binary numbers for which the sum of the 1's is greater than or equal to 2.

1.32k views • 20 slides

Backtracking

Backtracking. A short list of categories. Algorithm types we will consider include: Simple recursive algorithms Backtracking algorithms Divide and conquer algorithms Dynamic programming algorithms Greedy algorithms Branch and bound algorithms Brute force algorithms Randomized algorithms.

814 views • 21 slides

Backtracking

Backtracking. Backtracking. Suppose you have to make a series of decisions, among various choices, where You don’t have enough information to know what to choose Each decision leads to a new set of choices Some sequence of choices (possibly more than one) may be a solution to your problem

861 views • 20 slides

Backtracking

Backtracking. Introduction. Systematic way to do an exhaustive search Take advantage of pruning when possible. Turnpike Reconstruction Problem. Given |D| distances, determine x coordinates for points lying on x-axis |D|=N(N-1)/2

447 views • 8 slides

Backtracking

Backtracking. Sum of Subsets and Knapsack. Backtracking. Two versions of backtracking algorithms Solution needs only to be feasible ( satisfy problem’s constraints) sum of subsets Solution needs also to be optimal knapsack . The backtracking method.

1.11k views • 36 slides

Backtracking

Backtracking. Reading Material: Chapter 13, Sections 1, 2, 4, and 5. Coping with Hard Problems. There are three useful methodologies that could be used to cope with problems having no efficient algorithm to solve:

342 views • 15 slides

Backtracking Intrusions

Backtracking Intrusions. Sam King Peter Chen CoVirt Project, University of Michigan. Motivation. Computer break-ins increasing Computer forensics is important How did they get in. Current Forensic Methods. Manual inspection of existing logs System, application logs

402 views • 24 slides

BackTracking

BackTracking. CS255. N-Queens. The object is to place queens on a chess board in such as way as no queen can capture another one in a single move Recall that a queen can move horz, vert, or diagonally an infinite distance

665 views • 46 slides

Backtracking

Backtracking. Algorithm. For some types of problems, we need to be able to: Search Try many different configurations Most of these notes are taken straight from the author’s website – go there and listen to 2007 lecture on Backtracking http://www.cs.sunysb.edu/~algorith/video-lectures/

292 views • 14 slides

Backtracking

Backtracking. Eight queens problem 1 try all possible C 64 8 = 4,426,165,368 2 never put more than one queen on a given row, vector representation : each row specify which column (3,1,6,2,8,6,4,7). 1 2 3 4 5 6 7 8. X. X. X. X. X. X. X. X. (3,1,6,2,8,6,4,7).

277 views • 8 slides

Backtracking

Backtracking. Introduction to Backtracking. Backtracking. Junction. Backtracking is a technique used to solve problems with a large search space, by systematically trying and eliminating possibilities. A standard example of backtracking would be going through a maze.

626 views • 20 slides

Controlling Backtracking

Controlling Backtracking. Notes for Ch.5 of Bratko For CE NG 421 Fall 03. Preventing Backtracking. Prolog automatically backtracks in its attempts to satisfy a goal (equivalently, in its traversal of a goal tree) Sometimes, backtracking is a source of inefficiency

354 views • 13 slides

Backtracking

Backtracking. Depth-First Search N-Queens Problem Hamiltonian Circuits. Backtracking.

193 views • 16 slides

Backtracking

619 views • 37 slides

Backtracking

Backtracking. Introduction to Backtracking. A short list of categories. Algorithm types we will consider include: Simple recursive algorithms Backtracking algorithms Divide and conquer algorithms Dynamic programming algorithms Greedy algorithms Branch and bound algorithms

681 views • 19 slides

backtracking

Design and analysis of Algorithms backtracking

245 views • 16 slides

More Related