BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Erika Roldan (TU München)
DTSTART:20220519T141500Z
DTEND:20220519T160000Z
DTSTAMP:20260422T065639Z
UID:CJCS/68
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/CJCS/68/">Pa
 rity Property of Hexagonal Sliding Puzzles</a>\nby Erika Roldan (TU Münch
 en) as part of Copenhagen-Jerusalem Combinatorics Seminar\n\n\nAbstract\nW
 e study the puzzle graphs of hexagonal sliding puzzles of various shapes a
 nd with various numbers of holes. The puzzle graph is a combinatorial mode
 l which captures the solvability and the complexity of sequential mechanic
 al puzzles. Questions relating to the puzzle graph have been previously st
 udied and resolved for the 15 Puzzle which is the most famous\, and unsolv
 able\, square sliding puzzle of all times. The puzzle graph is also a disc
 rete model for the configuration space of hard tiles (hexagons or squares)
  moving on different tessellation-based domains. Understanding the combina
 torics of the puzzle graph leads to understanding some aspects of the topo
 logy of these configuration spaces.\n
LOCATION:https://researchseminars.org/talk/CJCS/68/
END:VEVENT
END:VCALENDAR