Abstract / résuméCUMC / CCEM 2005



Name / nom: Jacob Tsimerman

School / école: University of Toronto

Length / durée: 25 min

Title / titre: Grid Graphs: Almost Topology

Abstract / résumé: A damaged chess king who can't move diagonally makes his way around a 4n x 2m board, in such a way that he visits every square once and returns to the square he started at. Can the number of vertical moves he made be the same as the number of horizontal moves? Can we generalize this question to something which I could talk about for 25 minutes? What's all this talk about cheese?

Prerequisites / choses nécessaires: None listed.



PDF format / format PDF: tsimerman.pdf