  In this thesis we enumerate standard young tableaux (SYT) of certain
truncated skew shapes, which we call battery shapes. This is motivated by a
chess problem. In an enumerative chess problem, the set of moves in the
solution is (usually) unique, but the order is not. The task of counting the
feasible permutations may be accomplished by solving an equivalent problem in
enumerative combinatorics. Almost all such problems have been of a special type
known as series movers. In this thesis we use generalized hypergeometric
functions to enumerate SYT of battery shapes, and thus solve a chess problem
posed by Buchanan.
