Backtracking - Algoviz Wiki

Works

Yes

Description

Presents a small tutorial on backtracking, and then has a detailed animated example of the 4 Queens problem (a smaller version of the 8 Queens problem, on a 4 x 4 board). Under the field with the Queens the algorithm is described verbally. The separate steps are highlighted using colours.

Evaluation

Clear presentation. User should be able to understand how backtracking works form watching this.

Animation; Step Control; Canned Data

Roessling2000; Roessling2002

Lecture Aid; Self Study

Screenshots

Videos

References

For detailed instructions on how to install Animal and run Animal AVs, see: http://www.algoanim.info/Animal2/?q=node/290. Once you have installed the Animal .jar file and downloaded/unpacked the .zip file of Animal animations, you are now ready to run Animal. Run the .jar file to start Animal. Then go to the "Open" menu item, and browse to where you put the animal animations you got in the .zip file. Click on "backtracking" from the list. You can then step through the animation, or use "kiosk mode" to have the steps fed to you at a constant pace.

First Visited

2007-07-21

Last Visited

2010-02-04

Last Updated

1999-05-03

Topic

Community

Average rating:	4.0
Your rating:	You must be logged in to Rate.

http://www.cs.duke.edu/courses/cps100/fall02/lects/sep17/recurexamp.html

Edit

You may edit this entry if you have an account.

JAWAA - Recursion Example

Recommendation

Has Potential

Link

Delivery Method

Java Applet

License

Non-OSI Open Source

Language

English

Author

Susan Rodger

Institution

Duke University

Project

JAWAA

Works

Yes

Description

Animation of the recursion stack associated with the operation of a simple function that repeatedly divides by two until the value of one is reached.

Evaluation

Weaknesses: Passive animation, no possibility to step line by line or step backward nor to give the input. The dark red color does not show very clearly. Good: Smooth animation makes it possible to recognize where the changes are happening. Comments: The visual presentation of the stack gets the point across that there is a stack associated with recursion, and that each function has its own values for the parameters. Not easy to follow or compelling. Meant to be used in context of lecture notes.

Animation Only; Canned Data

Lecture Aid

Screenshots

Videos

References

First Visited

2006-09-02

Last Visited

2008-07-23

Last Updated

2002

Topic

Community

Average rating:	2.0
Your rating:	You must be logged in to Rate.

http://www.cosc.canterbury.ac.nz/mukundan/dsal/ToHdb.html

Edit

You may edit this entry if you have an account.

Java Applets Centre - Tower of Hanoi

Recommendation

Not Recommended

Link

Delivery Method

Java Applet

License

Unavailable

Language

English

Author

R. Mukundan

Institution

University of Canterbury

Project

Java Applets Centre

Works

Yes

Description

User selects a number of disks, and then an animation showing the disk moves is presented.

Evaluation

Very simple. User has no control over the pacing.

Animation Only

Lecture Aid

Screenshots

Videos

References

First Visited

2006-04-03

Last Visited

2008-07-21

Last Updated

2006

Topic

Community

Average rating:	unrated
Your rating:	You must be logged in to Rate.

Edit

You may edit this entry if you have an account.

JHAVÉ - Backtracking with 15 Puzzle

Recommendation

Has Potential

Link

http://jhave.org/learner

Delivery Method

Java Web Start

License

CreativeCommons

Language

English

Author

Tom Naps

Institution

University of Wisconsin - Oshkosh

Project

JHAVÉ

Works

Yes

Description

Visualization of backtracking using the 15 puzzle as an example.

Evaluation

The AV is set up as a series of "slides" in one pane, and pseudocode in the adjacent pane. As the user steps through the "slides", the associated pseudocode is highlighted. Occasional questions pop up for the user to answer. The AV includes a nice explanation of how backtracking works. The only real problem with this presentation is that the nodes on the graph are relatively big, and the tree quickly runs off the screen, with no scrolling available.

Step Control; Questions; Canned Data

Lecture Aid; Self Study; Lab Exercise

Screenshots

Videos

References

First Visited

2008-07-08

Last Visited

2008-07-10

Last Updated

2008-07-01

Topic

Community

Average rating:	unrated
Your rating:	You must be logged in to Rate.

http://students.ceid.upatras.gr/~papagel/project/kef5_8.htm

Edit

You may edit this entry if you have an account.

UPatras Backtrack

Recommendation

Unrated

Link

Delivery Method

Java Applet

License

Language

English

Author

Institution

University of Patras

Project

UPatras Collection

PartOfCollection

Works

Description

8 queens problem.

Evaluation

Screenshots

Videos

References

First Visited

Last Visited

Last Updated

Topic

Community

Average rating:	unrated
Your rating:	You must be logged in to Rate.

http://www.cosc.canterbury.ac.nz/people/mukundan/dsal/NQP.html

Edit

You may edit this entry if you have an account.

Java Applets Centre - N-Queens Problem

Recommendation

Not Recommended

Link

Delivery Method

Java Applet

License

Unavailable

Language

English

Author

R. Mukundan

Institution

University of Canterbury

Project

Java Applets Centre

Works

Yes

Description

Simple animation of the placement steps taken when solving the 8 queens problem using backtracking.

Evaluation

User just watches the pieces being placed.

Animation Only

Lecture Aid

Screenshots

Videos

References

First Visited

2006-04-03

Last Visited

2008-07-21

Last Updated

2006

Topic

Community

Average rating:	unrated
Your rating:	You must be logged in to Rate.

http://www.animal.ahrgr.de/showAnimationDetails.php3?anim=9; http://www.animal.ahrgr.de/showAnimationDetails.php3?anim=63

Edit

You may edit this entry if you have an account.

Animal - Branch and Bounds

Recommendation

Has Potential

Link

Delivery Method

Animal Animation

License

Non-Commercial

Language

English; German

Author

Guido Rössling

Institution

TU Darmstadt, Darmstadt, Germany

Project

Animal

Works

Yes

Description

Presents a small tutorial on branch and bounds, and shows an example on a small graph computing a traveling salesman tour.

Evaluation

Reasonably good example, though there is no branch-and-bounds tree, so it is hard to understand the relationship of the B&B process to solving the TS problem. NOTE: There are two other Branch and Bounds demonstrations at this site (one on knapsack problem), but those are hard to follow and would be Not Recommended.

Animation; Step Control; Canned Data

Lecture Aid; Self Study

Screenshots

Videos

References

For detailed instructions on how to install Animal and run Animal AVs, see: http://www.algoanim.info/Animal2/?q=node/290. Once you have installed the Animal .jar file and downloaded/unpacked the .zip file of Animal animations, you are now ready to run Animal. Run the .jar file to start Animal. Then go to the "Open" menu item, and browse to where you put the animal animations you got in the .zip file. Pick this AV from the list. You can then step through the animation, or use "kiosk mode" to have the steps fed to you at a constant pace.

First Visited

2007-07-21

Last Visited

2008-07-24

Last Updated

1999-05-10

Topic

Community

Average rating:	unrated
Your rating:	You must be logged in to Rate.

http://alvie.algoritmica.org/

Edit

You may edit this entry if you have an account.

ALVIE - TOH Backtracking

Recommendation

Unrated

Link

Delivery Method

Java Application

License

By Request

Language

English

Author

Pilu Crescenzi

Institution

University of Florence

Project

ALVIE

Works

Yes

Description

Walkthrough for the Towers of Hanoi algorithm.

Evaluation

Simple-to-use user interface for walking through the example. Simply open up the AV (see directions below) and step through the example with pseudo-code. As you go through the example, you are directed to the corresponding line in the pseudocode and given a line or two of explanation in the message window. Attractive layout of the data, including colors.

Step Control; Canned Data

http://sites.google.com/site/alviehomepage/alvie3/downoads/hanoiTower.swf

Lecture Aid; Self Study

Screenshots

Videos

References

Download and unzip the ALVIE system from the website. Double click on the .jar file. Within the ALVIE pane (not the GRIND pane), click on the "eye" icon (third icon from the left in the toolbar) to get a list of algorithms from which select the AV that you want. Once selected, click OK and step through the AV with the arrow icons.

First Visited

2010-01-29

Last Visited

2010-01-29

Last Updated

2009-12-20

Topic

Community

Average rating:	unrated
Your rating:	You must be logged in to Rate.

http://alvie.algoritmica.org/

Edit

You may edit this entry if you have an account.

ALVIE - Sodoku by Backtracking

Recommendation

Unrated

Link

Delivery Method

Java Application

License

By Request

Language

English

Author

Pilu Crescenzi

Institution

University of Florence

Project

ALVIE

Works

Yes

Description

Walkthrough showing a backtracking algorithm to solve Sodoku puzzles.

Evaluation

Step Control; Canned Data

http://sites.google.com/site/alviehomepage/alvie3/downoads/sudoku.swf

Lecture Aid; Self Study

Screenshots

Videos

References

First Visited

2010-01-29

Last Visited

2010-01-29

Last Updated

2009-12-20

Topic

Community

Average rating:	unrated
Your rating:	You must be logged in to Rate.

http://www.animal.ahrgr.de/showAnimationDetails.php3?anim=10

Edit

You may edit this entry if you have an account.

Animal - Knapsack with Branch and Bounds

Recommendation

Unrated

Link

Delivery Method

Animal Animation

License

Non-Commercial

Language

English

Author

Oscar Davidson, Dennis Burns, Jonathan Kressin, Suchi Perry

Institution

TU Darmstadt, Darmstadt, Germany

Project

Animal

Works

Yes

Description

Presents a slideshow with an example walking through a branch-and-bounds approach to solving the Knapsack problem. The site has other similar examples of traversing the evaluation tree for Knapsack.

Evaluation

Animation; Step Control; Canned Data

Lecture Aid; Self Study

Screenshots

Videos

References

For detailed instructions on how to install Animal and run Animal AVs, see: http://www.algoanim.info/Animal2/?q=node/290. Once you have installed the Animal .jar file and downloaded/unpacked the .zip file of Animal animations, you are now ready to run Animal. Run the .jar file to start Animal. Then go to the "Open" menu item, and browse to where you put the animal animations you got in the .zip file. Pick this AV from the list. You can then step through the animation, or use "kiosk mode" to have the steps fed to you at a constant pace.

First Visited

2010-02-04

Last Visited

2010-02-04

Last Updated

2000-05-17

Topic

Community

Average rating:	unrated
Your rating:	You must be logged in to Rate.