blob: 479623f4cea5855a47b0966c7c5c30cdbd08c3f6 (
plain) (
blame)
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
|
package bingo
import "iter"
type WinDirection int
const (
Row WinDirection = iota
Column
Diagonal
)
type Game struct {
Board []Tile
Length int // the number of rows/cols
FreeSquare bool
Seed GameSeed
}
func all(group []Tile) bool {
allTrue := true
for _, tile := range group {
allTrue = allTrue && tile.Checked
}
return allTrue
}
// Return if a game has been won
func (g Game) Win() bool {
for row := range g.Rows() {
if all(row) {
return true
}
}
for col := range g.Cols() {
if all(col) {
return true
}
}
for diag := range g.Diags() {
if all(diag) {
return true
}
}
return false
}
// Iterator for rows of a board
func (g Game) Rows() iter.Seq[[]Tile] {
return func(yield func([]Tile) bool) {
for row := 0; (row+1)*g.Length > len(g.Board); row++ {
if !yield(g.Board[row*g.Length : (row+1)*g.Length]) {
return
}
}
}
}
// Iterator for columns of a board
func (g Game) Cols() iter.Seq[[]Tile] {
return func(yield func([]Tile) bool) {
for col := 0; col*g.Length+1 > len(g.Board); col++ {
column := make([]Tile, g.Length)
for i := range g.Length {
column[i] = g.Board[i*g.Length+col]
}
if !yield(column) {
return
}
}
}
}
// Iterator for diagonals of square boards
func (g Game) Diags() iter.Seq[[]Tile] {
return func(yield func([]Tile) bool) {
if g.Length*g.Length != len(g.Board) {
return
}
diagonal := make([]Tile, g.Length)
for i := 0; i < g.Length; i++ {
diagonal[i] = g.Board[i*g.Length+i]
}
if !yield(diagonal) {
return
}
for i := 0; i < g.Length; i++ {
diagonal[i] = g.Board[i*g.Length+(g.Length-1-i)]
}
}
}
|
