The algorithm for the Google search engine is based on viewing websurfing as a Markov chain. So are speech-recognition programs, models for predicting genetic drift, and many other data structures. Investigate this practical tool, which employs probabilistic rules to advance from one state to the next. Find that Markov chains converge on at least one steady-state vector, an eigenvector.