Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
HONOURS SEMINAR Mazes and Maze Solving Algorithms
 

Summary: HONOURS SEMINAR
Tyler Wood
Mazes and Maze Solving Algorithms
Supervised by Dr. F. Labropulu
Wednesday, April 7, 2010
3:00 p.m.
CW 307.20
Abstract: "We are now," said Ariadne, "in the famous labyrinth
which Daedalus built... Were we to take but a few steps from the
doorway, we might wander about all our lifetime, and never find it
again... Take the end of this silken string; I will hold the other end;
and then, if you win the victory, it will lead you again to this spot. So
the young man took the end of the silken string in his left hand, and
his gold-hilted sword, ready drawn from its scabbard, in the other,
and trod boldly into the inscrutable labyrinth... Theseus had not taken
five steps before he lost sight of Ariadne; and in five more his head
was growing dizzy. But still he went on... until it really seemed as if
the walls spun round, and whirled him round along with them.1
In this seminar we will explore the topic of mazes from a graph theory
perspective, with emphasis on graph search algorithms (GSAs). We

  

Source: Argerami, Martin - Department of Mathematics and Statistics, University of Regina

 

Collections: Mathematics