Department of Computer Science | Institute of Theoretical Computer Science | CADMO
Theory of Combinatorial Algorithms
Prof. Emo Welzl and Prof. Bernd Gärtner
Department of Computer Science | Institute of Theoretical Computer Science | CADMO
Prof. Emo Welzl and Prof. Bernd Gärtner
| Mittagsseminar Talk Information |
Date and Time: Thursday, November 14, 2002, 12:15 pm
Duration: This information is not available in the database
Location: This information is not available in the database
Speaker: Martin Kutz (FU Berlin)
We play a game with a chess king on an infinite checker board. The king moves across the board, according to the usual chess rules, and we want to trap him by destroying squares of the board. Precisely, in each move the king steps onto an undamaged square adjacent to his current position and we in turn delete an arbitrary square from the board (except the one under the king, of course). Can you trap the king, that is, do you have a strategy such that at some point the king cannot move any more? Or is he able to run on forever?
Berlekamp showed that you can trap him. In fact, the strategy is not very complicated. But the problem gets amazingly difficult if you increase the power of the king. Conway defined a k-angel to be a "king" that can "fly" in one move to any untouched square at distance at most k from his current position. He then asked whether the opponent--whom he figuratively calls "the devil"--can catch any angel of arbitrary power k. This problem remains unsolved for at least two decades now.
In this talk we will revisit some well-known, yet rather counterintuitive facts about possible escape strategies. Then we introduce a slight variant of the problem which turns out asymptotically equivalent. Under these refined conditions we are able to prove slight improvements upon Berlekamp's devil result revealing further peculiarities and possible fallacies of this "everlasting game."
Upcoming talks | All previous talks | Talks by speaker | 
Upcoming talks in iCal format (beta version!)
Previous talks by year: 2024 2023 2022 2021 2020 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996
Information for students and suggested topics for student talks
Automatic MiSe System Software Version 1.4803M | admin login
