Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9506579 | Applied Mathematics and Computation | 2005 | 26 Pages |
Abstract
Besides presenting a combinatorial solution to the general problem, and discussing its “expressive complexity” via its relationship with the well-known integer partition problem, we also provide a computer solution, implemented in Prolog, based on a non-trivial recurrence relation. Relying on the latter result, we then carry out preliminary analysis of the computational aspects of some of the rules governing the Cribbage game.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Zhizhang Shen,