We apply the Sprague–Grundy theorem to LCTR, a new impartial
game on partitions in which players take turns removing either the
left column or the top row of the corresponding Young diagram. We
establish that the Sprague–Grundy value of any partition is at most
and
determine Sprague–Grundy values for several infinite families of partitions. Finally,
we devise a dynamic programming approach which, for a given partition
of
,
determines the corresponding Sprague–Grundy value in
time.
PDF Access Denied
We have not been able to recognize your IP address
18.97.14.89
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our
journal-recommendation form.
Or, visit our
subscription page
for instructions on purchasing a subscription.