| 12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061 |
- \relax
- \citation{Bezzel}
- \citation{Nauck}
- \citation{Pauls}
- \citation{Pauls_2}
- \citation{Bell_Stevens}
- \citation{Noon}
- \@writefile{toc}{\contentsline {section}{\numberline {1}Introduction}{1}}
- \@writefile{toc}{\contentsline {section}{\numberline {2}The mod 2 \textit {n}-queens game}{2}}
- \providecommand*\caption@xref[2]{\@setref\relax\@undefined{#1}}
- \newlabel{gradient_board}{{1a}{3}}
- \newlabel{sub@gradient_board}{{a}{3}}
- \newlabel{mod2_gradient}{{1b}{3}}
- \newlabel{sub@mod2_gradient}{{b}{3}}
- \@writefile{lof}{\contentsline {figure}{\numberline {1}{\ignorespaces \relax }}{3}}
- \@writefile{toc}{\contentsline {section}{\numberline {3}Complete Chessboards}{4}}
- \newlabel{Complete}{{3}{4}}
- \newlabel{odd_complete}{{3.1}{4}}
- \@writefile{lof}{\contentsline {figure}{\numberline {2}{\ignorespaces An unlocked $11\times 11$ chessboard\relax }}{4}}
- \newlabel{unlocked_11}{{2}{4}}
- \newlabel{unlocked_3}{{3a}{5}}
- \newlabel{sub@unlocked_3}{{a}{5}}
- \newlabel{odd_step1}{{3b}{5}}
- \newlabel{sub@odd_step1}{{b}{5}}
- \newlabel{odd_step2}{{3c}{5}}
- \newlabel{sub@odd_step2}{{c}{5}}
- \@writefile{lof}{\contentsline {figure}{\numberline {3}{\ignorespaces Steps in the construction of a complete board for $n$ odd.\relax }}{5}}
- \newlabel{XX}{{3}{5}}
- \newlabel{even_not_complete}{{3.2}{6}}
- \newlabel{even_complete}{{3.3}{6}}
- \@writefile{toc}{\contentsline {section}{\numberline {4}Locked Chessboards}{6}}
- \newlabel{Locked}{{4}{6}}
- \newlabel{locked_2}{{4a}{7}}
- \newlabel{sub@locked_2}{{a}{7}}
- \newlabel{locked_3}{{4b}{7}}
- \newlabel{sub@locked_3}{{b}{7}}
- \newlabel{locked_11}{{5a}{7}}
- \newlabel{sub@locked_11}{{a}{7}}
- \newlabel{locked_12}{{5b}{7}}
- \newlabel{sub@locked_12}{{b}{7}}
- \@writefile{lof}{\contentsline {figure}{\numberline {5}{\ignorespaces Examples of even-sized and odd-sized locked boards\relax }}{7}}
- \newlabel{general_locked}{{5}{7}}
- \newlabel{odd_locked}{{4.1}{7}}
- \@writefile{lof}{\contentsline {figure}{\numberline {6}{\ignorespaces A sequence of game positions to create a locked $3\times 3$ chessboard\relax }}{8}}
- \newlabel{locked_n=3}{{6}{8}}
- \@writefile{toc}{\contentsline {section}{\numberline {5}In the Alternate Universe}{9}}
- \newlabel{Alternate}{{5}{9}}
- \@writefile{toc}{\contentsline {section}{\numberline {6}Game Trees, Graphs, and Complexity}{10}}
- \newlabel{Graph}{{6}{10}}
- \bibcite{Bell_Stevens}{1}
- \bibcite{Bezzel}{2}
- \bibcite{Nauck}{3}
- \bibcite{Noon}{4}
- \bibcite{Pauls}{5}
- \bibcite{Pauls_2}{6}
- \@writefile{lof}{\contentsline {figure}{\numberline {7}{\ignorespaces Partial game tree for $n=3$\relax }}{11}}
- \newlabel{game_tree}{{7}{11}}
- \newlabel{RF1}{12}
- \@writefile{lof}{\contentsline {figure}{\numberline {8}{\ignorespaces Game graph for $n=3$\relax }}{12}}
- \newlabel{fullgraph}{{8}{12}}
|