質問編集履歴
1
コードの追加
test
CHANGED
|
File without changes
|
test
CHANGED
|
@@ -8,4 +8,94 @@
|
|
|
8
8
|
|
|
9
9
|
|
|
10
10
|
|
|
11
|
+
|
|
12
|
+
|
|
13
|
+
```javascript
|
|
14
|
+
|
|
15
|
+
function bronze(n)
|
|
16
|
+
|
|
17
|
+
{
|
|
18
|
+
|
|
19
|
+
|
|
20
|
+
|
|
21
|
+
var LEFTUP = 0
|
|
22
|
+
|
|
23
|
+
var RIGHT = 1
|
|
24
|
+
|
|
25
|
+
var DOWN = 2
|
|
26
|
+
|
|
27
|
+
|
|
28
|
+
|
|
29
|
+
function make_masu(n)
|
|
30
|
+
|
|
31
|
+
{
|
|
32
|
+
|
|
33
|
+
var state = []
|
|
34
|
+
|
|
35
|
+
var i
|
|
36
|
+
|
|
37
|
+
for(i = 0;i < n * n;i++) state[i] = 0
|
|
38
|
+
|
|
39
|
+
|
|
40
|
+
|
|
41
|
+
return state
|
|
42
|
+
|
|
43
|
+
}
|
|
44
|
+
|
|
45
|
+
|
|
46
|
+
|
|
47
|
+
function move(state,now,move)
|
|
48
|
+
|
|
49
|
+
{
|
|
50
|
+
|
|
51
|
+
var now_x = now % n
|
|
52
|
+
|
|
53
|
+
var now_y = Math.floor(now / n)
|
|
54
|
+
|
|
55
|
+
|
|
56
|
+
|
|
57
|
+
if (move == DOWN && now_y > n - 1){
|
|
58
|
+
|
|
59
|
+
state[now + n] = 1
|
|
60
|
+
|
|
61
|
+
now = now + n
|
|
62
|
+
|
|
63
|
+
} else if (move == LEFTUP && 0 < now_y && 0 < now_x){
|
|
64
|
+
|
|
65
|
+
state[now - n - 1] = 1
|
|
66
|
+
|
|
67
|
+
now = now - n - 1
|
|
68
|
+
|
|
69
|
+
} else if (move == RIGHT && now_x < n - 1){
|
|
70
|
+
|
|
71
|
+
state[now + 1] = 1
|
|
72
|
+
|
|
73
|
+
now = now + 1
|
|
74
|
+
|
|
75
|
+
}
|
|
76
|
+
|
|
77
|
+
return state
|
|
78
|
+
|
|
79
|
+
}
|
|
80
|
+
|
|
81
|
+
function next_move(state,now)
|
|
82
|
+
|
|
83
|
+
{
|
|
84
|
+
|
|
85
|
+
|
|
86
|
+
|
|
87
|
+
}
|
|
88
|
+
|
|
89
|
+
function search(start)
|
|
90
|
+
|
|
91
|
+
{
|
|
92
|
+
|
|
93
|
+
|
|
94
|
+
|
|
95
|
+
}
|
|
96
|
+
|
|
97
|
+
}
|
|
98
|
+
|
|
99
|
+
```
|
|
100
|
+
|
|
11
|
-
|
|
101
|
+
マスの状態をstateで与えてstateが1の場所は一度訪れたことがある場所という感じで考えているのですが,探索の仕方のアイデアが思いつかないです。
|