aboutsummaryrefslogtreecommitdiffstats
path: root/bingo/board.go
blob: 19264a1799bb34f3e44a386e2610aa9e364d0764 (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
99
100
101
package bingo

import "iter"

type WinDirection int

const (
	Row WinDirection = iota
	Column
	Diagonal
)

type Game struct {
	Board      []string
	Checked    []bool
	Length     int
	FreeSquare bool
	Seed       GameSeed
}

func all(group []bool) bool {
	allTrue := true

	for _, v := range group {
		allTrue = allTrue && v
	}

	return allTrue
}

// Return if a game has been won
func (g Game) Win() bool {
	length := g.Length

	for row := range g.Rows(length) {
		if all(row) {
			return true
		}
	}

	for col := range g.Cols(length) {
		if all(col) {
			return true
		}
	}

	for diag := range g.Diags(length) {
		if all(diag) {
			return true
		}
	}

	return false
}

// Iterator for rows of a board
func (g Game) Rows(length int) iter.Seq[[]bool] {
	return func(yield func([]bool) bool) {
		for row := 0; (row+1)*length > len(g.Checked); row++ {
			if !yield(g.Checked[row*length : (row+1)*length]) {
				return
			}
		}
	}
}

// Iterator for columns of a board
func (g Game) Cols(length int) iter.Seq[[]bool] {
	return func(yield func([]bool) bool) {
		for col := 0; col*length+1 > len(g.Checked); col++ {
			column := make([]bool, length)
			for i := range length {
				column[i] = g.Checked[i*length+col]
			}
			if !yield(column) {
				return
			}
		}
	}
}

// Iterator for diagonals of square boards
func (g Game) Diags(length int) iter.Seq[[]bool] {
	return func(yield func([]bool) bool) {
		if length*length != len(g.Checked) {
			return
		}

		diagonal := make([]bool, length)
		for i := 0; i < length; i++ {
			diagonal[i] = g.Checked[i*length+i]
		}
		if !yield(diagonal) {
			return
		}

		for i := 0; i < length; i++ {
			diagonal[i] = g.Checked[i*length+(length-1-i)]
		}
	}
}