The queen on a chess board is the most
powerful piece. From one square, the queen can
attack anywhere around it in a straight line
without skipping squares (as the diagram
illustrates on the right). The squares where the
arrow cuts through are the ones the queen can
attack and the queen can carry on attacking in
those straight lines. However the queen can't jump squares to attack,
these squares are marked with an x.
I will carry out my task systematically, drawing chess grids smallest to largest.
*2 by 2*4 by 4*6 by 6*8 by 8
*3 by 3*5 by 5*7 by 7*9 by 9
I will display how many places a queen can attack from a given square by writing the attacked amount in the square from were she attacked.
Chess Board SizeSquares attacked from Layer
From my table I notice an immediate trend.
As the chess board size increases all the attacked amounts increase by three and as the layers increase the attacked amount increases by two. I will attempt to find rules for these layers.
Chess board size(n)
3n=3 x chess board size
Places attacked - 3n-3-3-3-3-3-3
3n - 3
Chess board size(n)3x3
Places attacked - 3n
3n - 1
Chess board size(n)5x5
Places attacked - 3n11111
3n + 1
Chess board size(n)7x7
Places attacked - 3n333
3n + 3
I used my graph to support my linear rules. To plot the linear lines I used the method y = mx + c. Where m is the gradient...