The talk describes an application of computer algebra for the creation of
mathematical puzzles for mathematics contests. Because this involves the
formulation and solution of tens of thousands of polynomial systems this
application is a useful test of the robustness of polynomial system
solvers.