Skip to content →

Tag: games

changes

Tomorrow
I’ll give my last class of the semester (year?) so it is about time to
think about things to do (such as preparing the courses for the
“master program on noncommutative geometry”) and changes to make to
this weblog (now that it passed the 25000 mark it is time for something
different). In the sidebar I’ve added a little poll to let you guess
what changes 2005 will bring to this blog (if I find the time over
Christmas to implement it). In short, @matrix will
become the portal of a little company I’ll start up (seems
_the_ thing to do now). Here are some possible names/goals. Which
one will it be? Vote and find out after Christmas.

WebMathNess is a Web-service company helping lazy
mathematicians to set up their website and make it LaTeXRender savvy
(free restyling every 6 months).

iHomeEntertaining is a
Tech-company helping Mac-families to get most out of their valuable
computers focussing on Audio-Photo-Video streaming along their Airport-network.

SnortGipfGames is a Game-company focussing on the
mathematical side of the Gipf project
games
by distributing Snort-versions of them.

NeverendingBooks is a Publishing-company specializing
in neverending mathematical course- and book-projects offering their
hopeless authors print on demand and eprint services.

QuiverMerch is a Merchandising-company specializing in
quivers. For example, T-shirts with the tame quiver classification,
Calogero-Moser coffee mugs, Lego-boxes to construct local quivers
etc.

Leave a Comment

Elkiesโ€™ puzzles

Noam D. Elkies is a
Harvard mathematician whose main research interests have to do with
lattices and elliptic curves. He is also a very talented composer of
chess problems. The problem to teh left is a proof game
in 14 moves. That is, find the UNIQUE legal chess game leading to the
given situation after the 14th move by black. Elkies has also written a
beautiful paper On Numbers
and Endgames
applying combinatorial game theory (a la Winning
Ways!) to chess-endgames (mutual Zugzwang positions correspond to zero
positions) and a follow-up article Higher Nimbers in pawn
endgames on large chessboards
. Together with Richard Stanley he wrote a
paper for the Mathematical Intelligencer called The Mathematical
Knight
which is stuffed with chess problems! But perhaps most
surprising is that he managed to run his own course on Chess and
Mathematics
!

Leave a Comment

COLgo

COL is a map-coloring game invented by Colin Vout.
Two players Left (bLack) and Right (white) take turns in coloring the
map subject to the rule that no two neighboring regions may be colored
the same. The last player to be able to move wins the game. For my talk
on combinatorial game theory in two weeks, I choose for a simplified
version of COL, namely COLgo which is played with go-stoned on a
(partial) go-board. Each spot has 4 neighbors (North, East, South and
West). For example, the picture on the left is a legal COLgo-position on
a 5×5 board. COL is a simple game to illustrate some of the key features
of game theory. In sharp contrast to other games, one has a general
result on the possible values of a COL-position : each position has
value $z$ or $z+\\bigstar$ where $z$ is a (Conway)-number (that is, a
dyadic integer) and where $\\bigstar$ is the fuzzy game {0|0}. In
the talk I will give a proof of this result (there are not so many
results in combinatorial game theory one can prove from scratch in 50
minutes but this is one of them). Of course, to illustrate the result I
had to find positions which have counter-intuitive values such as 1/2.
The picture on the left is an example of such a position on a 5×5 board
but surely one must be able to find 1/2-positions on a 4×4 board
(perhaps even on a 3×3?). If you have an example, please tell me.

On a slightly different matter : I used the psgo.sty package in LaTeX to print the (partial)
go-boards and positions. If I ever write out the notes I’ll post them
here but they will be in Dutch.

Leave a Comment