如何列出二维数组中任意两元素间的所有可能路径

board[0][0] board[0][1] board[0][2]
*board[0] *(board[0]+1) *(board[0]+2)
**board *(*board+1) *(*board+2)

board[1][0] board[1][1] board[1][2]
*(board[0]+3) *(board[0]+4) *(board[0]+5)
*board[1] *(board[1]+1) *(board[1]+2)
*(*board+3) *(*board+4) *(*board+5)

board[2][0] board[2][1] board[2][2]
*(board[0]+6) *(board[0]+7) *(board[0]+8)
*(board[1]+3) *(board[1]+4) *(board[1]+5)
*board[2] *(board[2]+1) *(board[2]+2)
*(*board+6) *(*board+7) *(*board+8)

回答完毕!!~~给分吧..ο(∩_∩)ο
以上就是C代码........

楼上的枚举法是不是...
用N进制数（构造数组）即可