BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//jEvents 2.0 for Joomla//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:STANDARD
DTSTART:20231121T170000
RDATE:20240310T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20241103T010000
RDATE:20250309T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20251102T010000
RDATE:20260308T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20261101T010000
RDATE:20270314T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20271107T010000
RDATE:20280312T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20281105T010000
RDATE:20290311T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20240310T030000
RDATE:20241103T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20250309T030000
RDATE:20251102T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20260308T030000
RDATE:20261101T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20270314T030000
RDATE:20271107T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20280312T030000
RDATE:20281105T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:d666a2fa4ff87c80e19d0db2775c13c8
CATEGORIES:Experimental Mathematics Seminar
CREATED:20241010T184239
SUMMARY:Games Played Randomly-Chomp and Nim
LOCATION:https://rutgers.zoom.us/j/91865817691  [password: The 20th Catalan number\,
  alias (40)!/(20!*21!)\, alias 6564120420 ]
DESCRIPTION:Abstract: In this talk, we discuss combinatorial games where both players m
 ove randomly (each turn, independently selecting a legal move uniformly at 
 random), and we will emphasize the "experimental math" approach that was th
 e backbone of our results. We provide closed-form expressions for the expec
 ted number of turns in a game of Chomp with any starting condition. We also
  derive and prove formulas for the win probabilities for any game of Chomp 
 with at most two rows. Additionally, we completely analyze the game of nim 
 under random play by finding the expected number of turns and win probabili
 ties from any starting position. No familiarity with probability is require
 d, as the talk quickly reduces to studying certain recurrence relations tha
 t naturally arise from each game\n
X-ALT-DESC;FMTTYPE=text/html:<p><em style="color: #000000; font-family: 'Times New Roman'; font-size: me
 dium; font-weight: 400; letter-spacing: normal; orphans: 2; text-align: sta
 rt; text-indent: 0px; text-transform: none; white-space: normal; widows: 2;
  word-spacing: 0px;">Abstract</em>: In this talk, we discuss combinatorial 
 games where both players move randomly (each turn, independently selecting 
 a legal move uniformly at random), and we will emphasize the "experimental 
 math" approach that was the backbone of our results. We provide closed-form
  expressions for the expected number of turns in a game of Chomp with any s
 tarting condition. We also derive and prove formulas for the win probabilit
 ies for any game of Chomp with at most two rows. Additionally, we completel
 y analyze the game of nim under random play by finding the expected number 
 of turns and win probabilities from any starting position. No familiarity w
 ith probability is required, as the talk quickly reduces to studying certai
 n recurrence relations that naturally arise from each game</p>
CONTACT:Pat Devlin and Paulina Trifonova, Swarthmore College
DTSTAMP:20260828T175457
DTSTART;TZID=America/New_York:20241121T170000
DTEND;TZID=America/New_York:20241121T180000
SEQUENCE:0
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR