DisCoMath Seminar: Strategy Stealing Games
Event Image
CoMath Seminar
Strategy Stealing Games
Dr. Matthew Coppenbarger
School of Mathematics and Statistics
Rochester Institute of Technology
Abstract:
In combinatorial game theory, a strategy-stealing argument shows that, for a two-person game, the first player has a guaranteed winning strategy. The argument was invented by John Nash in the 1940s to show that the game Hex is always a first-player win. The main discussion of the talk will be on two games, Chomp and Bridg-It. Some additional games may be discussed.
Keep up with DisCoMath Seminars on the DisCoMathS webpage.
Intended Audience:
All are welcome.
To request an interpreter, please visit myaccess.rit.edu
Event Snapshot
When and Where
Who
This is an RIT Only Event
Interpreter Requested?
No
Topics
research