/
ga_trial.go
275 lines (250 loc) · 5.27 KB
/
ga_trial.go
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
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
package main
import (
"bufio"
"flag"
"fmt"
"os"
"path/filepath"
"strconv"
"time"
"github.com/cbarrick/magic-square/ga"
)
var synopsis = `synopsis:
This program runs the genetic algorithm experiment. A file named
'trials.pl' containing the possible trials to run must exist in the current
working directory.
`
// value of command line arguments
var (
gen = flag.String("g", "siamese1", "the generator type of the trial.")
order = flag.Int("o", 3, "the order of the trial.")
dif = flag.String("d", "easy", "the dificulty of the trial.")
count = flag.Int("n", 1, "the number of times to run the trial.")
timeout = flag.Int("t", 30, "timeout in seconds")
help = flag.Bool("h", false, "show this help message.")
)
// printHelp prints a usage message
func printHelp() {
name := filepath.Base(os.Args[0])
fmt.Fprintln(os.Stderr, "usage:\n\t", name, "<args>\n")
fmt.Fprintln(os.Stderr, synopsis)
fmt.Fprintln(os.Stderr, "arguments:")
flag.PrintDefaults()
}
// main fetches a schema from trials.pl and tries to solve it with the GA.
func main() {
// read the command line arguments and get the schema
flag.Parse()
if *help {
printHelp()
return
}
schema := getSchema()
// run the ga and print the average time of the trials
var avg float64
ret := make(chan ga.Square, 1)
stop := time.After(time.Duration(*timeout) * time.Second)
start := time.Now()
for i := 0; i < *count; i++ {
go ga.Solve(schema, ret)
select {
case <-ret:
case <-stop:
fmt.Print("timeout")
return
}
}
avg = float64(time.Since(start).Nanoseconds()) / 1e9 / float64(*count)
fmt.Println(avg)
}
// Parser
// --------------------------------------------------
// Everything below this point is helper code to read trials from the file.
// Use getSchema to retreive a specific trial.
type trial struct {
order int // order of the square
gen string // algorithm generating the square
dif string // difficulty of the schema
schema ga.Square // decoded schema
}
type unexpectedErr struct{}
func (unexpectedErr) Error() string {
return "unexpected input"
}
func getSchema() ga.Square {
f, err := os.Open("./trials.pl")
defer f.Close()
if err != nil {
panic(err.Error())
}
input := bufio.NewReader(f)
for {
t, err := readTrial(input)
if err != nil {
panic(err.Error())
}
if t.order == *order && t.gen == *gen && t.dif == *dif {
return t.schema
}
}
}
func readTrial(r *bufio.Reader) (t trial, err error) {
char := make([]byte, 1)
char, err = r.Peek(1)
if err != nil {
return t, err
}
switch string(char) {
// skip comments
case "%":
err = skipline(r)
if err != nil {
return t, err
}
return readTrial(r)
// skip blank lines
case "\n":
err = expect(r, "\n")
if err != nil {
return t, err
}
return readTrial(r)
// start parsing a trial
case "t":
err = expect(r, "trial(")
if err != nil {
return t, err
}
t.order, t.gen, t.dif, err = readMetadata(r)
if err != nil {
return t, err
}
t.schema, err = readSquare(r, t.order)
if err != nil {
return t, err
}
err = skipline(r)
if err != nil {
return t, err
}
return t, nil
default:
return t, unexpectedErr{}
}
}
func skipline(r *bufio.Reader) (err error) {
var char rune
for {
char, _, err = r.ReadRune()
if err != nil {
return err
}
if char == '\n' {
return nil
}
}
}
func readMetadata(r *bufio.Reader) (order int, gen, dif string, err error) {
// order
str, err := r.ReadString(byte(','))
if err != nil {
return order, gen, dif, err
}
order, err = strconv.Atoi(str[:len(str)-1])
if err != nil {
return order, gen, dif, err
}
// generator
str, err = r.ReadString(byte(','))
gen = str[:len(str)-1]
if err != nil {
return order, gen, dif, err
}
// difficulty
str, err = r.ReadString(byte(','))
dif = str[:len(str)-1]
if err != nil {
return order, gen, dif, err
}
return order, gen, dif, nil
}
func readSquare(r *bufio.Reader, order int) (schema ga.Square, err error) {
err = expect(r, "[")
if err != nil {
return schema, err
}
depth := 1
schema = ga.NewSquare(order)
i, j := 0, 0
for {
char, err := r.Peek(1)
if err != nil {
return schema, err
}
switch string(char) {
case "[":
err = expect(r, "[")
if err != nil {
return schema, err
}
depth++
case "]":
err = expect(r, "]")
if err != nil {
return schema, err
}
i++
j = 0
depth--
if depth == 0 {
return schema, nil
}
case ",":
err = expect(r, ",")
if err != nil {
return schema, err
}
case "_":
err = expect(r, "_")
if err != nil {
return schema, err
}
j++
default:
bytes := make([]byte, 0, 3)
for {
char, err := r.Peek(1)
if err != nil {
return schema, err
}
if byte('0') <= char[0] && char[0] <= byte('9') {
err = expect(r, string(char))
if err != nil {
return schema, err
}
bytes = append(bytes, char[0])
} else {
break
}
}
n, err := strconv.Atoi(string(bytes))
if err != nil {
return schema, err
}
schema.Sq[i][j] = n
j++
}
}
}
func expect(r *bufio.Reader, str string) (err error) {
n := len(str)
bytes := make([]byte, n)
_, err = r.Read(bytes)
if err != nil {
return err
}
if string(bytes) != str {
panic(fmt.Sprintf("expected '%v', found '%v'", str, bytes))
}
return nil
}