Computing a perfect strategy for n x [i.e. superscript] n chess requires time exponential in n /

"UILU-ENG 79 1716."

Sperner's theorem on maximal-sized antichains and its generation /

Includes bibliographical references.

Use of macros in backtrack programming /

Thesis (M.S.)--University of Illinois at Urbana-Champaign.