|
DP Virtual Studio

Library Home ||
Full Table of Contents ||
Suggest a Link ||
Library Help

| http://www.worms.ms.unimelb.edu.au/ | |
|
|
|
| World-Wide-Web for Operations Research and Management Science (WORMS) | |
| Links to DP (dynamic programming) animations from the Dept. of Mathematics and Statistics, Univ. of Melbourne, Australia. The Knapsack problem: fill a knapsack with available items so as to maximize the total value of the items; The Towers of Noah (a variation on the Tower of Hanoi); 8 Easy pieces (restore the tiles to their original position as quickly as possible); 8 Queens Puzzle: (place N queens on an 8x8 chessboard so that they do not attack each other); The Travelling Spider Problem: A travelling spider must visit n Web sites, each only once, commencing and terminating the tour at his/her home site: determine a tour that minimizes the travel time). | |
|
|
|
| Levels: | High School (9-12) |
| Languages: | English |
| Resource Types: | Problems/Puzzles, Web Interactive/Java |
| Math Topics: | Discrete Math, Dynamic Programming, Optimization |
[Privacy Policy] [Terms of Use]


© 1994-2008 Drexel University. All rights reserved.
http://mathforum.org/
The Math Forum is a research and educational enterprise of the Drexel School of Education.