=+2. A drunken knight is placed on an empty chess board and randomly moves according to the usual chess rule. Calculate the equilibrium distribution of the knight’s position [152]. (Hints: Consider the squares to be nodes of a graph. Connect two squares by an edge if the knight can move from one to the other in one step. Show that the graph is connected and that 4 squares have degree 2, 8 squares have degree 3, 20 squares have degree 4, 16 squares have degree 6, and 16 squares have degree 8.)