EDW 524: Workshop in Discrete Mathematics

Discrete math puzzles:

• Water pouring puzzle

• Tower of Hanoi puzzle           

• Hourglass puzzle

• Missionaries & Cannibals puzzle  

• Move the Trains puzzle  

• More Train Puzzles  

• Solve the Maze  

• Solve the Maze, with automatic solution

• The football scheduling problem

• The handshake problem

Graph Theory:

• Are these graphs the same? - see some examples  

• Are these graphs the same? - create your own graphs 

• Planarity Game

• Another Planarity Game

• Visit every edge once, if you can - Easier

• Visit every edge once, if you can - Harder

• Visit every vertex once, if you can

• Color the USA with only 4 colors

• Take a graph coloring quiz (make up any name and password)

• Related graph coloring problems

Algorithmic Graph Theory:

• The time required to complete a project (PERT)

• Shortest path - used by Mapquest (Dijkstra's algorithm) - see some examples

• Shortest path - used by Mapquest (Dijkstra's algorithm) - create your own network

• Traveling Salesperson Game

• Minimum spanning tree (Kruskal's algorithm)

• Network flow (Ford-Fulkerson algorithm) - see some examples

• Network flow (Ford-Fulkerson algorithm) - create your own network

Enumeration:

• Combinations and permutations

• Generating function problems