CPLEX input generator
Best known bounds
Bounds as linear functions
Sizes of sets found by geometric methods

---

Optimal s for d up to 400, k up to 20
Prime factorization of optimal s
Prime factorization of optimal s (top 1000)

---

An AP-free subset of {0, ..., 13} with 6 elements
An AP-free subset of {0, ..., 121} with 20 elements
An AP-free subset of {0, ..., 1093} with 70 elements
An AP-free subset of {0, ..., 9841} with 252 elements
An AP-free subset of {0, ..., 88573} with 924 elements
An AP-free subset of {0, ..., 976562} with 3102 elements
An AP-free subset of {0, ..., 7174452} with 12870 elements
An AP-free subset of {0, ..., 107179440} with 54209 elements

---

Warning: these applets require an up-to-date version of Java; inferior browsers may not be able to run them.
Applet to find AP-free sets by the geometric method.
Applet to browse colorings used in protocol for exactly-N.
Another (prettier) applet to browse colorings used in protocol for exactly-N.
Applet to explore van der Waerden numbers.

---

An Optimal Strategy for Yahtzee, Loyola College Technical Report CS-TR-0002. This describes work started in 1999 and presented at various schools as my job talk (which was good enough to land me at Lafayette College and then Loyola College). Independently, jar file for Yahtzee
javadoc for Yahtzee classes