-
Notifications
You must be signed in to change notification settings - Fork 0
/
ChessKnight.java
143 lines (130 loc) · 3.51 KB
/
ChessKnight.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
import java.util.*;
import java.util.regex.*;
import java.text.*;
import java.math.*;
import java.awt.geom.*;
public class ChessKnight
{
public double probability(int x, int y, int n)
{
double[][][] board = new double[110][8][8];
x--;
y--;
int[] dirv = {-2, -2, -1, 1, 2, 2, 1, -1};
int[] dirh = {-1, 1, 2, 2, 1, -1, -2, -2};
// n = 1
for (int r = 0; r < 8; r++)
{
for (int c = 0; c < 8; c++)
{
int count = 0;
for (int d = 0; d < 8; d++)
{
int dr = r+dirv[d];
int dc = c+dirh[d];
if (dr >= 0 && dr < 8 && dc >= 0 && dc < 8)
count++;
}
board[1][r][c] = (double) count/8.0;
}
}
for (int i = 2; i <= n; i++)
{
for (int r = 0; r < 8; r++)
{
for (int c = 0; c < 8; c++)
{
int count = 0;
double prob = 0;
for (int d = 0; d < 8; d++)
{
int dr = r+dirv[d];
int dc = c+dirh[d];
if (dr >= 0 && dr < 8 && dc >= 0 && dc < 8)
{
prob += board[i-1][dr][dc]/8;
}
}
board[i][r][c] = (double) board[i-1][r][c]*prob;
}
}
}
return board[n][x][y];
}
public static void main(String[] args)
{
long time;
double answer;
boolean errors = false;
double desiredAnswer;
time = System.currentTimeMillis();
answer = new ChessKnight().probability(1, 1, 2);
System.out.println("Time: " + (System.currentTimeMillis()-time)/1000.0 + " seconds");
desiredAnswer = 0.1875D;
System.out.println("Your answer:");
System.out.println("\t" + answer);
System.out.println("Desired answer:");
System.out.println("\t" + desiredAnswer);
if (answer != desiredAnswer)
{
errors = true;
System.out.println("DOESN'T MATCH!!!!");
}
else
System.out.println("Match :-)");
System.out.println();
time = System.currentTimeMillis();
answer = new ChessKnight().probability(4, 4, 1);
System.out.println("Time: " + (System.currentTimeMillis()-time)/1000.0 + " seconds");
desiredAnswer = 1.0D;
System.out.println("Your answer:");
System.out.println("\t" + answer);
System.out.println("Desired answer:");
System.out.println("\t" + desiredAnswer);
if (answer != desiredAnswer)
{
errors = true;
System.out.println("DOESN'T MATCH!!!!");
}
else
System.out.println("Match :-)");
System.out.println();
time = System.currentTimeMillis();
answer = new ChessKnight().probability(2, 3, 10);
System.out.println("Time: " + (System.currentTimeMillis()-time)/1000.0 + " seconds");
desiredAnswer = 0.0522148497402668D;
System.out.println("Your answer:");
System.out.println("\t" + answer);
System.out.println("Desired answer:");
System.out.println("\t" + desiredAnswer);
if (answer != desiredAnswer)
{
errors = true;
System.out.println("DOESN'T MATCH!!!!");
}
else
System.out.println("Match :-)");
System.out.println();
time = System.currentTimeMillis();
answer = new ChessKnight().probability(4, 3, 50);
System.out.println("Time: " + (System.currentTimeMillis()-time)/1000.0 + " seconds");
desiredAnswer = 8.356427906809618E-7D;
System.out.println("Your answer:");
System.out.println("\t" + answer);
System.out.println("Desired answer:");
System.out.println("\t" + desiredAnswer);
if (answer != desiredAnswer)
{
errors = true;
System.out.println("DOESN'T MATCH!!!!");
}
else
System.out.println("Match :-)");
System.out.println();
if (errors)
System.out.println("Some of the test cases had errors :-(");
else
System.out.println("You're a stud (at least on the test data)! :-D ");
}
}
//Powered by [KawigiEdit]