Probability and Markov chains in a knight's tour

139 Views Asked by At

I've been working on my math IA for a month now, but I cannot happen to stumble across anything important to calculate within my chosen topic. I've tried optimization of algorithms but it went wrong, as well as graph theory. I've been developing this new attempt by using matrices in order to get the long term probability of being in a given square of the 4x3 chessboard, but I cannot calculate the steady-state probability for the matrix. I'd appreciate any help or even another ideas in order to carry on with the project. This is the previous matrix I was talking about. Every state is a tile in which the knight can be placed, and the probability in the content of the matrix is the probability of landing in that square from the previous one.