Chip Stacking

Chip stacking is a poker trick where you take two stacks of chips, of the same height, and combine them using one hand in a fluid motion into a staggered (I hope that's the right word) stack of chips.

After stacking chips for some time I came to realize there is a certain varience in the number of times you need to stack the chips in order to return to the original stack configuration. an example of this are the 6-a-side and 7-a-side stacks: 6 chips on each side requires 12 shuffles to return to the original state, yet 7 chips on each side take only 4! here is a small list of chip heights vs. stackings required to return to original state:

Number of chips on each side:	Number of stackings required to return to original state:
1	2
2	4
3	3
4	6
5	10
6	12
7	4
8	8
9	18
10	6
11	11
12	20
13	18
14	28
15	5
16	10
17	12
18	36
19	12
20	20

(I hope tables are xhtml 1.1 compliant....)

You can learn more about this sequence of numbers at The On-Line Encyclopedia of Integer Sequences™.
so now you know some more of ChipStacker-0.5's features.
the full list is:

1. Generate List of shuffles per stack for stacks under a certain height
2. Find number of shuffles for a particular stack height
3. Determine whether your stack will ever solve
4. Show Sequence for Specific Stack Height

here is the C source code which you should be able to compile with your favourite c compiler... Chip.cpp

-Leav