• Share
  • Email
  • Embed
  • Like
  • Save
  • Private Content
How to Paint Your Way out of a Maze
 

How to Paint Your Way out of a Maze

on

  • 2,277 views

Many people don't realize that what we now call "algorithm design" actually dates back to the ancient Greeks! Of course, if you think about it, there's always the "Euclidean Algorithm". A more ...

Many people don't realize that what we now call "algorithm design" actually dates back to the ancient Greeks! Of course, if you think about it, there's always the "Euclidean Algorithm". A more dubious example might be Theseus's use of a ball of string to solve the "Labyrinth Problem". (Google "Theseus, Labyrinth, string".) Solutions to this problem got a lot less dubious after graph theory was invited, since a graph turns out to be a good way of representing a maze mathematically. We will examine the classical solutions to this problem, and then throw in a twist --- a Twisted Painting Machine that puts restrictions on which paths we can take to explore the maze. Applications to sewing may also appear, depending on the presence of audience interest and string.

Statistics

Views

Total Views
2,277
Views on SlideShare
2,275
Embed Views
2

Actions

Likes
0
Downloads
10
Comments
0

1 Embed 2

http://www.linkedin.com 2

Accessibility

Categories

Upload Details

Uploaded via as Adobe PDF

Usage Rights

© All Rights Reserved

Report content

Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
  • Full Name Full Name Comment goes here.
    Are you sure you want to
    Your message goes here
    Processing…
Post Comment
Edit your comment

    How to Paint Your Way out of a Maze How to Paint Your Way out of a Maze Presentation Transcript

    • How to Paint Your Way out of a Maze Prof. Joshua Holden, Rose-Hulman Inst. of Tech. Joint work with Lana Holden How to Paint Your Way out of a Maze – p. 1/3
    • Graphs and Digraphs DefinitionA (loop-free) graph is a set of vertices, V , and a set of edges, E, where each edge is an unordered pair of distinct vertices. Definition A (loop-free) digraph is a set of vertices, V , and a set of edges, E, where each edge is an ordered pair of distinct vertices. (The order is thought of as indicating a “direction”.) How to Paint Your Way out of a Maze – p. 2/3