CSUN Algebra, Number Theory, and Discrete Mathematics Seminar

Abstract: We consider a tic-tac-toe-style game on the vertices of the $n$-dimensional Boolean hypercube ${\{0,1\}}^n$ with $k$-dimensional subcubes as winning sets. We describe a pairing strategy which allows the second player to force a draw when $k=n∕4+1$ in the case where $n$ is a power of $4$.

(Based on joint work with Klay Kruczek and Ramin Naimi)