MisereSolver

July 19, 2005 at 1:24 am (software, solutions)


Aaron Siegel has already whipped together an amazing Java program for everything in my misere CGT paper, while also incorporating his own insights into algorithms for misere quotient semigroup computation. Given an octal game code as input, his program directly computes a presentation of its misere quotient semigroup to heap size n=1, 2, 3, in turn, together with the associated pretending functions and outcome partitions at each heap size n. He’s solved .15 (Guiles), .115, .114, and a bunch of wild quaternary games using this software.

Eventually his software will make into cgsuite, I hope.

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: