| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 421204 | Discrete Applied Mathematics | 2012 | 7 Pages |
Abstract
Given non-negative integers aa and bb, we consider the following game WYT(a,b)WYT(a,b). Given two piles that consist of xx and yy matches, and two players having alternate turns; a single move consists of a player choosing x′x′ matches from one pile and y′y′ from the other such that 0≤x′≤x,0≤y′≤y,0
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Vladimir Gurvich,