close this window
Complete the following form to e-mail a copy of this event to a friend.
Hello, The following event may be of interest to you: Hunter vs. Mole Thursday, November 14, 2013 A lecture byNatasha KomarovCarnegie Mellon UniversityWe consider a pursuit-evasion game played on a graph in which the pursuer—here referred to as “hunter”'—is not constrained by the graph but must play in the dark against a “mole.” It turns out that the graphs—which we will call “hunter-win”—on which the hunter can guarantee capture of the mole in bounded time have a nice characterization: a graph is hunter-win if and only if it is a lobster. We also define an optimal hunter strategy (and consequently an upper bound on maximum game time on hunter-win graphs) and note that an optimal hunter strategy need not take advantage of the hunter's unconstrained movement. Location: Hegeman 204 Sponsor: Mathematics Program Contact: Gregory Landweber. E-mail: [email protected] If you would like to see more events please visit the following URL: http://www.bard.edu/academics/programs/science/calendar/