Three-Rowed CHOMP

Author: Zeilberger D.

Source: Advances in Applied Mathematics, Volume 26, Number 2, February 2001 , pp. 168-179(12)

Publisher: Academic Press

Buy & download fulltext article:

OR

Price: $52.63 plus tax (Refund Policy)

Abstract:

A “meta” (pseudo-) algorithm is described that, for any fixed k, finds a fast (O(log(a))) algorithm for playing 3-rowed Chomp, starting with the first, second, and third rows of lengths a, b, and c, respectively, where c le k, but a and b are arbitrary. Copyright 2001 Academic Press.

Language: English

Document Type: Research article

Affiliations: Department of Mathematics, Temple University, Philadelphia, Pennsylvania, 19122

Publication date: 2001-02-01

Related content

Tools

Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content

Text size:

A | A | A | A
Share this item with others: These icons link to social bookmarking sites where readers can share and discover new web pages. print icon Print this page