Previously: Ordinal numbers and basic set theory We're going to get to in a long and roundabout way. First I
want to talk about the game of Nim. Nim Nim is a very simple game for two players. There are some
piles of beans, which are called nim-heaps . When it's your turn,
you are allowed to remove as many beans as you like, as long as they
are all in the same pile. Whoever takes the last bean…
The talks on the final day of Games At Mumbai continued the excellence of the week! Here are my summaries: Dhruv Basin, "On ergodicity of a 1-dimensional PCA with parity dependent updation rules" Dhruv talked about the site percolation problem--whether there are open clusters on randomly-generated graphs. In a game version of this, vertices (integer coordinates of the Cartesian plane, so the bo…
As a sophomore at Georgia Tech, I took a class on Combinatorial Game Theory with two good friends, David Hollis (now at Reckless Abandon Labs, which he founded) and Michelle Delcourt (now working towards her PhD at UIUC). As a final project, we were supposed to analyze a game combinatorially. The three of us ended […]
Last week I was at the Banff International Research Station for a workshop on Combinatorial Game Theory. It was excellent! I got to meet many CGT bigwigs, play a lot of great games, present some things and even prove a few things. Here were some highlights: Presenting Atropos Meeting 35 new friends Playing Cookie Cutter with creator Paul Ottaway Listening to current NoGo World Champion, Fan Xie…
As someone mentioned on the computational complexity blog yesterday , the Voronoi Game is a game of perfect information without randomness. The two-player version is a good partisan combinatorial game. The game is based on Voronoi diagrams, which describes which areas of a plane are closest to each of a collection of points. Given a set of points, S, in a space, a Voronoi diagram is a partition…
