Game tree, dynamic programming (computational good sub-problems stored, direct access later)

public class Gametree {
/**
* Judge the number of remaining balls, who can take the last who wins,
*, one to take, the default we first take, and can win, can return true, otherwise false
* @param x number of balls
* @return
/static Boolean f (int x) {
int[] op={1,3,7,8};//can only have four cases per fetch
(int i=0;i< op.length;i++) {
if (X>=op[i]) {
if (f (x-op[i)) ==false) return true;//game theory, the other side must lose, then we will win
}
} Return
false;//No matter how they go, all is true, then we must lose
}
The public static void main (string[] args) {
//is dynamically programmed to increase efficiency, the computed child problem is stored, and the
System.out.println (f ()) is taken directly later;
    
}
    
    
}

More Wonderful content: http://www.bianceng.cnhttp://www.bianceng.cn/Programming/sjjg/