\relax 
\providecommand\hyper@newdestlabel[2]{}
\providecommand\HyperFirstAtBeginDocument{\AtBeginDocument}
\HyperFirstAtBeginDocument{\ifx\hyper@anchor\@undefined
\global\let\oldcontentsline\contentsline
\gdef\contentsline#1#2#3#4{\oldcontentsline{#1}{#2}{#3}}
\global\let\oldnewlabel\newlabel
\gdef\newlabel#1#2{\newlabelxx{#1}#2}
\gdef\newlabelxx#1#2#3#4#5#6{\oldnewlabel{#1}{{#2}{#3}}}
\AtEndDocument{\ifx\hyper@anchor\@undefined
\let\contentsline\oldcontentsline
\let\newlabel\oldnewlabel
\fi}
\fi}
\global\let\hyper@last\relax 
\gdef\HyperFirstAtBeginDocument#1{#1}
\providecommand*\HyPL@Entry[1]{}
\citation{Stevens}
\citation{Stevens}
\HyPL@Entry{0<</S/D>>}
\@writefile{toc}{\contentsline {section}{\numberline {1}Introduction}{1}{section.1}}
\newlabel{S:intro}{{1}{1}{Introduction}{section.1}{}}
\@writefile{toc}{\contentsline {section}{\numberline {2}Regular chessboards}{1}{section.2}}
\newlabel{S:regboards}{{2}{1}{Regular chessboards}{section.2}{}}
\citation{Sloane}
\@writefile{lof}{\contentsline {figure}{\numberline {1}{\ignorespaces }}{2}{figure.1}}
\newlabel{Fig1}{{1}{2}{}{figure.1}{}}
\@writefile{lot}{\contentsline {table}{\numberline {1}{\ignorespaces The number of non-attacking bishop positions on a $3 \times n$ chessboard, where $n \geq 0$.}}{2}{table.1}}
\newlabel{Tab1}{{1}{2}{The number of non-attacking bishop positions on a $3 \times n$ chessboard, where $n \geq 0$}{table.1}{}}
\citation{Sloane}
\newlabel{b_t(n)}{{1}{3}{}{theorem.1}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {2}{\ignorespaces The two possible cases for a non-attacking bishop position on the black squares of a truncated $3 \times (2(k+1) + 1)$ chessboard, where $k \geq 1$.}}{3}{figure.2}}
\newlabel{FigTrun_odd}{{2}{3}{The two possible cases for a non-attacking bishop position on the black squares of a truncated $3 \times (2(k+1) + 1)$ chessboard, where $k \geq 1$}{figure.2}{}}
\@writefile{lot}{\contentsline {table}{\numberline {2}{\ignorespaces The number of non-attacking bishop positions on the black squares of a truncated $3 \times n$ chessboard, where $n \geq 1$ and odd.}}{4}{table.2}}
\newlabel{Tab2}{{2}{4}{The number of non-attacking bishop positions on the black squares of a truncated $3 \times n$ chessboard, where $n \geq 1$ and odd}{table.2}{}}
\@writefile{lot}{\contentsline {table}{\numberline {3}{\ignorespaces Some values of $a_{k}$.}}{4}{table.3}}
\newlabel{Tab3}{{3}{4}{Some values of $a_{k}$}{table.3}{}}
\newlabel{b(2n+1)}{{2}{4}{}{theorem.2}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {3}{\ignorespaces The possible cases for a non-attacking bishop position on the black squares of a $3 \times (2n+1)$ chessboard, where $n \geq 2$.}}{5}{figure.3}}
\newlabel{Fig_b3(2n+1)}{{3}{5}{The possible cases for a non-attacking bishop position on the black squares of a $3 \times (2n+1)$ chessboard, where $n \geq 2$}{figure.3}{}}
\newlabel{b(2n)}{{3}{5}{}{theorem.3}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {4}{\ignorespaces The possible cases for a non-attacking bishop position on the black squares of a $3 \times 2n$ chessboard, where $n \geq 2$.}}{5}{figure.4}}
\newlabel{Fig_b3(2n)}{{4}{5}{The possible cases for a non-attacking bishop position on the black squares of a $3 \times 2n$ chessboard, where $n \geq 2$}{figure.4}{}}
\newlabel{w(n)}{{4}{5}{}{theorem.4}{}}
\citation{Sloane}
\@writefile{lof}{\contentsline {figure}{\numberline {5}{\ignorespaces The possible cases for a non-attacking bishop position on the white squares of a $3 \times (2n+1)$ chessboard, where $n \geq 1$.}}{6}{figure.5}}
\newlabel{Fig_w3(2n+1)}{{5}{6}{The possible cases for a non-attacking bishop position on the white squares of a $3 \times (2n+1)$ chessboard, where $n \geq 1$}{figure.5}{}}
\newlabel{w_t(n)}{{5}{6}{}{theorem.5}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {6}{\ignorespaces The possible cases for a non-attacking bishop position on the white squares of a truncated $3 \times 4$ chessboard.}}{6}{figure.6}}
\newlabel{FigTrun_w3(4)}{{6}{6}{The possible cases for a non-attacking bishop position on the white squares of a truncated $3 \times 4$ chessboard}{figure.6}{}}
\@writefile{lot}{\contentsline {table}{\numberline {4}{\ignorespaces The number of non-attacking bishop positions on the white squares of a truncated $3 \times n$ chessboard, where $n \geq 0$ and even.}}{7}{table.4}}
\newlabel{Tab4}{{4}{7}{The number of non-attacking bishop positions on the white squares of a truncated $3 \times n$ chessboard, where $n \geq 0$ and even}{table.4}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {7}{\ignorespaces The possible cases for a non-attacking bishop position on the white squares of a $3 \times 2n$ chessboard, where $n \geq 2$.}}{8}{figure.7}}
\newlabel{Fig_w3(2n)}{{7}{8}{The possible cases for a non-attacking bishop position on the white squares of a $3 \times 2n$ chessboard, where $n \geq 2$}{figure.7}{}}
\citation{Zeil}
\citation{Grim}
\citation{Sloane}
\newlabel{Regular_3xn_B}{{7}{10}{}{theorem.7}{}}
\newlabel{reg_2xn_K}{{8}{10}{}{theorem.8}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {8}{\ignorespaces The possible cases for a non-attacking king position on a $2 \times n$ chessboard, where $n \geq 2$.}}{10}{figure.8}}
\newlabel{Fig_k2(n)}{{8}{10}{The possible cases for a non-attacking king position on a $2 \times n$ chessboard, where $n \geq 2$}{figure.8}{}}
\@writefile{lot}{\contentsline {table}{\numberline {5}{\ignorespaces The number of non-attacking king positions on a $2 \times n$ chessboard, where $n \geq 0$.}}{11}{table.5}}
\newlabel{TabK_2}{{5}{11}{The number of non-attacking king positions on a $2 \times n$ chessboard, where $n \geq 0$}{table.5}{}}
\newlabel{Sol_K_2}{{9}{11}{}{theorem.9}{}}
\citation{Sloane}
\newlabel{ExtendK_3xn}{{10}{12}{}{theorem.10}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {9}{\ignorespaces The two cases for a non-attacking king position on an extended $3 \times n$ chessboard, where $n \geq 1$.}}{12}{figure.9}}
\newlabel{Fig_kE(n)}{{9}{12}{The two cases for a non-attacking king position on an extended $3 \times n$ chessboard, where $n \geq 1$}{figure.9}{}}
\newlabel{K_3xn}{{11}{12}{}{theorem.11}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {10}{\ignorespaces The possible cases for a non-attacking king position on a $3 \times n$ chessboard, where $n \geq 2$.}}{12}{figure.10}}
\newlabel{Fig_k3(n)}{{10}{12}{The possible cases for a non-attacking king position on a $3 \times n$ chessboard, where $n \geq 2$}{figure.10}{}}
\citation{Sloane}
\@writefile{lot}{\contentsline {table}{\numberline {6}{\ignorespaces The number of non-attacking king positions on an extended $3 \times n$ chessboard, where $n \geq 0$.}}{13}{table.6}}
\newlabel{TabK_E}{{6}{13}{The number of non-attacking king positions on an extended $3 \times n$ chessboard, where $n \geq 0$}{table.6}{}}
\@writefile{lot}{\contentsline {table}{\numberline {7}{\ignorespaces The number of non-attacking king positions on a $3 \times n$ chessboard, where $n \geq 0$.}}{13}{table.7}}
\newlabel{TabK_3(n)}{{7}{13}{The number of non-attacking king positions on a $3 \times n$ chessboard, where $n \geq 0$}{table.7}{}}
\citation{Grim}
\citation{Sloane}
\newlabel{TheoremK_3(n)}{{12}{14}{}{theorem.12}{}}
\@writefile{toc}{\contentsline {section}{\numberline {3}Cylindrical chessboards}{14}{section.3}}
\newlabel{S:cyl}{{3}{14}{Cylindrical chessboards}{section.3}{}}
\newlabel{cyl_1xn_K}{{13}{14}{}{theorem.13}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {11}{\ignorespaces The possible cases for a non-attacking king position on a cylindrical $1 \times n$ chessboard, where $n \geq 2$ and even.}}{14}{figure.11}}
\newlabel{FigCyl_k1(n)}{{11}{14}{The possible cases for a non-attacking king position on a cylindrical $1 \times n$ chessboard, where $n \geq 2$ and even}{figure.11}{}}
\citation{Zeil}
\@writefile{lot}{\contentsline {table}{\numberline {8}{\ignorespaces The number of non-attacking king positions on a cylindrical $1 \times n$ chessboard, where $n \geq 0$ and even.}}{15}{table.8}}
\newlabel{Tab5}{{8}{15}{The number of non-attacking king positions on a cylindrical $1 \times n$ chessboard, where $n \geq 0$ and even}{table.8}{}}
\newlabel{TheoremCylK_1(n)}{{14}{15}{}{theorem.14}{}}
\citation{Sloane}
\citation{Sloane}
\newlabel{cyl_2xn_B}{{15}{16}{}{theorem.15}{}}
\@writefile{lot}{\contentsline {table}{\numberline {9}{\ignorespaces The number of non-attacking bishop positions on a cylindrical $2 \times n$ chessboard, where $n \geq 0$ and even.}}{16}{table.9}}
\newlabel{Tab6}{{9}{16}{The number of non-attacking bishop positions on a cylindrical $2 \times n$ chessboard, where $n \geq 0$ and even}{table.9}{}}
\newlabel{b_DT(n)}{{16}{16}{}{theorem.16}{}}
\citation{Sloane}
\@writefile{lof}{\contentsline {figure}{\numberline {12}{\ignorespaces The possible cases for a non-attacking bishop position on the black squares of a doubly truncated $3 \times n$ chessboard, where $n \geq 3$ and odd.}}{17}{figure.12}}
\newlabel{Fig_bDT(n)}{{12}{17}{The possible cases for a non-attacking bishop position on the black squares of a doubly truncated $3 \times n$ chessboard, where $n \geq 3$ and odd}{figure.12}{}}
\@writefile{lot}{\contentsline {table}{\numberline {10}{\ignorespaces The number of non-attacking bishop positions on the black squares of a doubly truncated $3 \times n$ chessboard, where $n \geq 1$ and odd.}}{17}{table.10}}
\newlabel{Tab7}{{10}{17}{The number of non-attacking bishop positions on the black squares of a doubly truncated $3 \times n$ chessboard, where $n \geq 1$ and odd}{table.10}{}}
\newlabel{Thm_cyl_b3xn}{{17}{17}{}{theorem.17}{}}
\citation{Zeil}
\@writefile{lof}{\contentsline {figure}{\numberline {13}{\ignorespaces The possible cases for a non-attacking bishop position on the black squares of a cylindrical $3 \times 4$ chessboard.}}{18}{figure.13}}
\newlabel{FigCyl_b3(4)}{{13}{18}{The possible cases for a non-attacking bishop position on the black squares of a cylindrical $3 \times 4$ chessboard}{figure.13}{}}
\newlabel{cyl_3xn_B}{{18}{18}{}{theorem.18}{}}
\citation{Sloane}
\citation{Sloane}
\@writefile{lof}{\contentsline {figure}{\numberline {14}{\ignorespaces The possible cases for a non-attacking bishop position on the black squares of a cylindrical $3 \times n$ chessboard, where $n \geq 6$ and even.}}{19}{figure.14}}
\newlabel{FigCyl_b3(n)}{{14}{19}{The possible cases for a non-attacking bishop position on the black squares of a cylindrical $3 \times n$ chessboard, where $n \geq 6$ and even}{figure.14}{}}
\newlabel{CylK2xn}{{19}{19}{}{theorem.19}{}}
\newlabel{Count_cylK2xn}{{20}{19}{}{theorem.20}{}}
\@writefile{lot}{\contentsline {table}{\numberline {11}{\ignorespaces The number of non-attacking bishop positions on the black squares of a cylindrical $3 \times n$ chessboard, where $n \geq 0$ and even.}}{20}{table.11}}
\newlabel{Tab8}{{11}{20}{The number of non-attacking bishop positions on the black squares of a cylindrical $3 \times n$ chessboard, where $n \geq 0$ and even}{table.11}{}}
\@writefile{lot}{\contentsline {table}{\numberline {12}{\ignorespaces The number of non-attacking bishop positions on a cylindrical $3 \times n$ chessboard, where $n \geq 0$ and even.}}{20}{table.12}}
\newlabel{Tab9}{{12}{20}{The number of non-attacking bishop positions on a cylindrical $3 \times n$ chessboard, where $n \geq 0$ and even}{table.12}{}}
\citation{Sloane}
\@writefile{lof}{\contentsline {figure}{\numberline {15}{\ignorespaces The possible cases for a non-attacking king position on a cylindrical $2 \times n$ chessboard, where $n \geq 4$ and even.}}{21}{figure.15}}
\newlabel{FigCyl_k2(n)}{{15}{21}{The possible cases for a non-attacking king position on a cylindrical $2 \times n$ chessboard, where $n \geq 4$ and even}{figure.15}{}}
\@writefile{lot}{\contentsline {table}{\numberline {13}{\ignorespaces The number of non-attacking king positions on a cylindrical $2 \times n$ chessboard, where $n \geq 0$ and even.}}{21}{table.13}}
\newlabel{TableValuesCylK2xn}{{13}{21}{The number of non-attacking king positions on a cylindrical $2 \times n$ chessboard, where $n \geq 0$ and even}{table.13}{}}
\newlabel{K_DE(n)}{{21}{21}{}{theorem.21}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {16}{\ignorespaces Non-attacking positions with two or three kings on a doubly extended $3 \times 1$ chessboard.}}{22}{figure.16}}
\newlabel{FigDE_K(1)}{{16}{22}{Non-attacking positions with two or three kings on a doubly extended $3 \times 1$ chessboard}{figure.16}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {17}{\ignorespaces Non-attacking positions with two kings on a cylindrical $3 \times 2$ chessboard.}}{22}{figure.17}}
\newlabel{FigCyl_K(2)}{{17}{22}{Non-attacking positions with two kings on a cylindrical $3 \times 2$ chessboard}{figure.17}{}}
\citation{Sloane}
\@writefile{lof}{\contentsline {figure}{\numberline {18}{\ignorespaces The possible cases for a non-attacking king position on a doubly extended $3 \times n$ chessboard, where $n \geq 2$.}}{23}{figure.18}}
\newlabel{FigDE_K(n)}{{18}{23}{The possible cases for a non-attacking king position on a doubly extended $3 \times n$ chessboard, where $n \geq 2$}{figure.18}{}}
\@writefile{lot}{\contentsline {table}{\numberline {14}{\ignorespaces The number of non-attacking king positions on a doubly extended $3 \times n$ chessboard, where $n \geq 0$.}}{23}{table.14}}
\newlabel{TableValuesK_DE3xn}{{14}{23}{The number of non-attacking king positions on a doubly extended $3 \times n$ chessboard, where $n \geq 0$}{table.14}{}}
\newlabel{CylK_3(n)}{{22}{23}{}{theorem.22}{}}
\citation{Zeil}
\citation{Sloane}
\citation{Sloane}
\citation{Sloane}
\@writefile{lof}{\contentsline {figure}{\numberline {19}{\ignorespaces The possible cases for a non-attacking king position on a cylindrical $3 \times n$ chessboard, where $n \geq 4$ and even.}}{24}{figure.19}}
\newlabel{FigCyl_k3(n)}{{19}{24}{The possible cases for a non-attacking king position on a cylindrical $3 \times n$ chessboard, where $n \geq 4$ and even}{figure.19}{}}
\newlabel{TheoremCylK_3(n)}{{23}{24}{}{theorem.23}{}}
\@writefile{toc}{\contentsline {section}{\numberline {4}Concluding remarks}{24}{section.4}}
\newlabel{S:remarks}{{4}{24}{Concluding remarks}{section.4}{}}
\citation{Kot}
\bibcite{Grim}{1}
\bibcite{Kot}{2}
\bibcite{Sloane}{3}
\bibcite{Stevens}{4}
\bibcite{Zeil}{5}
\@writefile{lot}{\contentsline {table}{\numberline {15}{\ignorespaces The number of non-attacking king positions on a cylindrical $3 \times n$ chessboard, where $n \geq 0$ and even.}}{25}{table.15}}
\newlabel{TableValuesCylK_3(n)}{{15}{25}{The number of non-attacking king positions on a cylindrical $3 \times n$ chessboard, where $n \geq 0$ and even}{table.15}{}}
\@writefile{toc}{\contentsline {section}{\numberline {5}Acknowledgments}{25}{section.5}}
\newlabel{S:acknow}{{5}{25}{Acknowledgments}{section.5}{}}