modify code

Author: algorithmzuo

ppt/算法讲解095【必备】博弈类问题必备内容详解-上.pptx

@@ -41,7 +41,7 @@ public static void main(String[] args) throws IOException {
 	}
 
 	public static String compute(int n) {
-		return n % 6 == 0 ? "Roy wins!" : "October wins!";
+		return n % 6 != 0 ? "October wins!" : "Roy wins!";
 	}
 
 }

src/class095/Code02_PrimePowerStones.java

@@ -55,7 +55,7 @@ public static String compute() {
 		if (sum == n) {
 			return (n & 1) == 1 ? "Brother" : "John";
 		} else {
-			return eor == 0 ? "Brother" : "John";
+			return eor != 0 ? "John" : "Brother";
 		}
 	}
 

src/class095/Code04_AntiNimGame.java

@@ -21,6 +21,7 @@
 
 public class Code06_WythoffGame {
 
+	// 黄金分割比例
 	public static double split = (Math.sqrt(5.0) + 1.0) / 2.0;
 
 	public static int a, b;
@@ -43,10 +44,14 @@ public static void main(String[] args) throws IOException {
 	public static int compute() {
 		int min = Math.min(a, b);
 		int max = Math.max(a, b);
-		if (min == (int) (split * (max - min))) {
-			return 0;
-		} else {
+		// 威佐夫博弈
+		// 小 != (大 - 小) * 黄金分割比例，先手赢
+		// 小 == (大 - 小) * 黄金分割比例，后手赢
+		// 要向下取整
+		if (min != (int) (split * (max - min))) {
 			return 1;
+		} else {
+			return 0;
 		}
 	}