Josh Purinton
unread,Mar 21, 2008, 5:05:12 PM3/21/08Sign in to reply to author
Sign in to forward
You do not have permission to delete messages in this group
Sign in to report message
Either email addresses are anonymous for this group or you need the view member email addresses permission to view the original message
to Dan Hoey, sprouts...@googlegroups.com, Jeff Peltier, danny purvis, aaron.n...@gmail.com, Thane Plambeck
Is the conjecutre below true? If so, it would provide an efficient way to test for tameness, analagous to the way we now compute the misere Grundy number of G by computing o-(G+*0), o-(G+*1), o-(G+*2), etc. stopping when the outcome class is P.
Definition. "G is R-indistinguishable from H" if and only if for all games K in ruleset R, o+(G+K) = o+(H+K) and o-(G+K) = o-(H+K).
Definition. "G is tame" if and only if G is nim-indistuingishable from some sum of nim heaps.
Definition. "max-size-k nim" is the game of nim in which the size of each heap is at most k.
Conjecture. Given a game G, let k = max(Grundy+(G), Grundy-(G)) + 1. Then "G is tame" if and only if G is max-size-k-nim-indistinguishable from some sum of nim-heaps, each of which is of size at most k.