1 1 x 1 1 chessboard is taken and two of it's squares are colored red and the rest are colored blue. We consider two arrangements to be similar if one can be obtained from another by rotation of the plane of the board.How many dissimilar color schemes are possible???
An
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
If you explained it using Polya Enumeration Theorem aka Burnside's Lemma, it will be easier to see how this relates to a more general scenario.
Log in to reply
Should I do a post onpolya enumeration?
We'll use Burnside's lemma which states that when a group G acts on a set X then the number of orbits formed by the action, which is the number of equivalent configurations, is given by ∣ G ∣ 1 g ∈ G ∑ F i x ( g ) where F i x ( g ) is the set of elements of X that are fixed by g ∈ G .
Here, our G is the set of four transformations: identity, rotation by 90 degrees clockwise, rotation by 90 degrees counterclockwise, and the 180 degree rotation. Our X is the set of ( 2 1 2 1 ) = 7 2 6 0 ways that we can place our 2 red squares.
The identity fixes all 7260 configurations. The two 90 degree rotations do not fix any of the configurations. The 180 degree rotation fixes configurations where the two red squares are diametrically opposite each other, of which there are 60. Thus, the number of orbits is:
4 1 ( 7 2 6 0 + 6 0 ) = 1 8 3 0
There are a total of 1 2 1 C 2 ways to pick two of the 1 2 1 squares to paint red, but these are not all distinct if we consider rotations indistinguishable.
There are 2 cases to consider:
color schemes which have the two red squares:
1. diametrically opposing
2.non-diametrically opposing.
NOTE: (pick any square other than the center and the diametrically opposing square )
1 2 0 choices, then divide by 2 since we could have picked them in either order
Each painting of the 1st case has 2 distinct rotations which are indistinguishable color schemes, and each painting of the 2nd case has 4 distinct rotation
Thus the total number of distinct color schemes is 6 0 / 2 + 7 2 0 0 / 4 = 1 8 3 0
Problem Loading...
Note Loading...
Set Loading...
Clearly there are ( 2 1 2 1 ) = 7 2 6 0 possible ways to select the position of the red squares.
But as quarter turns are allowed,the number of possibilities is much less than this
There are two types of configurations:-
1 . Color schemes that are diametrically opposite:-
Color schemes in which two red squares are diametrically opposite in the chessboard appear in 2 equivalent(or similar forms).This is because these forms can be obtained by rotating the chessboard via two quarter-turns.Some example of diametrically opposite squares are given in the diagram below.
img2
Each position in the chessboard except the center square will have one and only one opposite square which will constitute can equivalent arrangement.So the numbers of pairs of such equivalent squares = 2 1 2 1 − 1 = 6 0 .Note that we divide by two to prevent over-counting.
Since there the equivalent forms is counted twice the number of distinct arrangements of squares in the equivalent position = 2 6 0 = 3 0 .
2 . Color schemes that are not diametrically opposite:-
The color schemes that are not diametrically opposite can appear in 4 equivalent forms.Each equivalent form can be obtained by a quarter turn of the chessboard.The total number of such forms is 7 2 6 0 − 6 0 = 7 2 0 0 .An example of not diametrically opposite square is shown below
img3
So the number of distinct forms = 7 2 0 0 / 4 = 1 8 0 0
Hence the total number of possible arrangements subject to the given constraints is 1 8 0 0 + 3 0 = 1 8 3 0