BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Alpha-Beta Pruning Explored\, Extended and Verified - Professor To
 bias Nipkow (Technische Universität München)
DTSTART:20240613T160000Z
DTEND:20240613T170000Z
UID:TALK216049@talks.cam.ac.uk
CONTACT:Anand Rao Tadipatri
DESCRIPTION:Alpha-beta pruning is an efficient search strategy for two-pla
 yer game trees. It was invented in the late 1950s and is at the heart of m
 ost implementations of combinatorial game playing programs. In this talk I
  will survey my recent formalizations and verifications of a number of sta
 ndard variations of alpha-beta pruning. Findings include:\n\n- Basic varia
 nts already having a property ascribed to an improved version\n\n- Authors
  being confused about which algebraic structure they actually work in\n\n-
  Generalizations to new algebraic structures\n\n- The implementation in a 
 famous paper is flawed\n\n---\n\nWatch online here:\nhttps://cam-ac-uk.zoo
 m.us/j/89453157536?pwd=lUNbK9xamhh2B6O7Df6bNfUEEkGrVo.1
LOCATION:Live-streamed at MR14 Centre for Mathematical Sciences
END:VEVENT
END:VCALENDAR