This preview shows page 1. Sign up to view the full content.
Unformatted text preview: Let an arc join nodes i and j if a knight can move from i to j in one move. Recall that a knight moves two squares in one direction (horizontally or vertically) and one square in another direction (horizontally or vertically), not allowing both horizontal or both vertical. We also use Remark (ii) in Section 4.4 on p. 215 (p. 205 in the 9th edition) about the relation between the expected time to return to a state and the steady-state probability of being in that state, plus the formula for the steady-state limiting probability i toward the end of Example 4.36 on p. 254 (Example 4.32 on p. 241 of the 9th edition)....
View Full Document
- Spring '11
- Operations Research