用java输出马走日的路径有关问题，求解_J2SE

用java输出马走日的路径问题，求解
具体是：在一个8x4的棋盘上，左下角的坐标为（0，0），马从左下角开始走到最右边（也就是x=8），打印输出所有的可能路线，比如（0，0），（2，1），（4，2），（6，3），（8，2）;（只要走到最右边的线，x=8即可，纵坐标不超过4即可，马只能向右走不能走回头路，输出所有的路线来）谢谢

------解决方案--------------------
有点啰嗦的代码，观望更好的吧：

Java code

import java.awt.Point;import java.util.ArrayList;import java.util.List;public class Test3 {    List<Point> list = new ArrayList<Point>();    public static void main(String[] args) {        Test3 test = new Test3();        test.list.add(new Point(0, 0));        test.path(new Point(0, 0));    }    public void path(Point curPoint) {        if (curPoint.x > 8 || curPoint.y > 4 || curPoint.x < 0                || curPoint.y < 0)            return;        if (curPoint.x == 8) {            for (int i = 0; i < list.size(); i++) {                System.out.print("(" + list.get(i).x + "," + list.get(i).y                        + ")");            }            System.out.println();            return;        }        Point point = new Point(curPoint.x + 1, curPoint.y + 2);        fun(point);        point = new Point(curPoint.x + 2, curPoint.y + 1);        fun(point);//        point = new Point(curPoint.x - 1, curPoint.y + 2);//        fun(point);////        point = new Point(curPoint.x - 2, curPoint.y + 1);//        fun(point);        point = new Point(curPoint.x + 1, curPoint.y - 2);        fun(point);        point = new Point(curPoint.x + 2, curPoint.y - 1);        fun(point);//        point = new Point(curPoint.x - 1, curPoint.y - 2);//        fun(point);////        point = new Point(curPoint.x - 2, curPoint.y - 1);//        fun(point);    }    private void fun(Point point) {        if (!list.contains(point)) {            list.add(point);            path(point);            list.remove(point);        }    }}
------解决方案--------------------
Java codepublic class HorseMove {    static Boolean isAllow(int x, int y){        if(x >= 0 && x <= 8 && y >= 0 && y <= 4)            return true;        return false;    }    static void move(int x, int y, int[][] mean, int[][] step, int stepCnt){            if(x == 8 && y >= 0 && y <= 4){                        System.out.print("(0  0)  ");            for(int i = 0; i < 8 && step[0][i]!=0; ++i)                System.out.print("(" + step[0][i] + "  " + step[1][i] + ")  ");            System.out.println();            return;        }        for(int j = 0; j < 4; ++j){            if(isAllow(x+mean[0][j], y+mean[1][j])){                                step[0][stepCnt] = x+mean[0][j];                step[1][stepCnt] = y+mean[1][j];                move(x+mean[0][j], y+mean[1][j], mean, step, stepCnt+1);            }                    }    }    public static void main(String[] args){        int[][] mean = {{1, 2, 2, 1}, {2, 1, -1, 2}};                int[][] step = new int[2][8];        for(int i = 0; i < 2; ++i)            for(int j = 0; j < 8; ++j)                step[i][j] = 0;        move(0, 0, mean, step, 0);    }}
------解决方案--------------------
探讨
Java code


public class HorseMove {
    static Boolean isAllow(int x, int y){
        if(x >= 0 &amp;&amp; x <= 8 &amp;&amp; y >= 0 &amp;&amp; y <= 4)
            return true;
        return f……