本帖最后由 王守恩 于 2022-6-8 16:25 编辑
一颗棋子位于原点,它的移动规则和马一样(走日字格),求它的坐标为(n,m)时,棋子的最小移动步数。
给出第一象限的最小移动步数。
9,
8,9,
9,8,9,
8,7,8,7,
7,8,7,8,7,
6,7,6,7,6,7,
7,6,7,6,7,6,7,
6,5,6,5,6,5,6,7,
5,6,5,6,5,6,5,6,7,
4,5,4,5,4,5,6,5,6,7,
5,4,5,4,5,4,5,6,5,6,7,
4,3,4,3,4,5,4,5,6,5,6,7,
3,4,3,4,3,4,5,4,5,6,5,6,7,
2,3,2,3,4,3,4,5,4,5,6,7,6,7,
3,2,3,2,3,4,3,4,5,6,5,6,7,8,7,
2,1,4,3,2,3,4,5,4,5,6,7,6,7,8,9,
3,2,1,2,3,4,3,4,5,6,5,6,7,8,7,8,9,
0,3,2,3,2,3,4,5,4,5,6,7,6,7,8,9,8,9,
|