Department of Computer Science | Institute of Theoretical Computer Science | CADMO
Prof. Emo Welzl and Prof. Bernd Gärtner
Mittagsseminar Talk Information |
Date and Time: Tuesday, November 27, 2007, 12:15 pm
Duration: This information is not available in the database
Location: OAT S15/S16/S17
Speaker: Divesh Aggarwal
The Angel and devil play their game on an infinite chessboard. On his turn, the Devil may eat any square of the board whatsoever; this square is then no longer available to the Angel. The Angel of power p may move to any square at distance at most p from its present position. The Devil wins if he can catch (surround) the Angel. The Angel wins if he can continue to move forever. It was known that the devil can defeat an angel of power 1. The case for p greater than 1 was open for a long time. But recently four independent proofs have appeared, each of them showing that the Angel is able to win. In this talk one of them will be presented.
Paper by András Máthé, The Angel of power 2 wins, to appear in Combinatorics, Probability and Computing.
Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)
Previous talks by year: 2025 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