Description: In the m line n chessboard out of the S point has one Chinese chess horse, given chessboard another point T, located the right side of T in S (as in the figure below). Ma date the provisions of the word go and only go to the right, from S go T, Ma, at least the number of steps to go?
To Search:
- [VC6Games] - VC++ Game programming, including mine cl
- [textbkdd] - An invaluable focus on the electronic do
- [socket] - Realize a simple C/S, similar to a chat
- [mine] - We are all very familiar with the proced
- [xiangqi] - The source is C++ Made the chess game, t
File list (Check if you may need any files):