92 lines
1.2 KiB
Go
92 lines
1.2 KiB
Go
package main
|
|
|
|
import "log"
|
|
|
|
type state struct {
|
|
teams []team
|
|
gameOver bool
|
|
}
|
|
|
|
func newState() state {
|
|
var teams []team
|
|
for i := 0; i < numTeams; i++ {
|
|
var bots []bot
|
|
for j := 0; j < numBots; j++ {
|
|
bots = append(bots, bot{pos: j * (steps / numBots)})
|
|
}
|
|
teams = append(teams, team{
|
|
bots: bots,
|
|
baton: baton{holder: &bots[0]},
|
|
})
|
|
}
|
|
|
|
return state{
|
|
teams: teams,
|
|
}
|
|
}
|
|
|
|
type team struct {
|
|
bots []bot
|
|
baton baton
|
|
won bool
|
|
}
|
|
|
|
type bot struct {
|
|
pos int
|
|
}
|
|
|
|
type baton struct {
|
|
holder *bot
|
|
}
|
|
|
|
func updateState(sOld state) state {
|
|
s := sOld
|
|
|
|
for i, t := range s.teams {
|
|
b := t.baton.holder
|
|
b.pos++
|
|
maybePassBaton(&s.teams[i])
|
|
}
|
|
|
|
for _, t := range s.teams {
|
|
if won(*t.baton.holder, s) {
|
|
s.gameOver = true
|
|
}
|
|
}
|
|
|
|
return s
|
|
}
|
|
|
|
func maybePassBaton(t *team) {
|
|
for i, b := range t.bots {
|
|
h := t.baton.holder
|
|
if h == &b {
|
|
continue
|
|
}
|
|
if b.pos-h.pos == 1 {
|
|
log.Printf("pass from %v to %v!", t.baton.holder, &t.bots[i])
|
|
t.baton.holder = &t.bots[i]
|
|
return
|
|
}
|
|
}
|
|
}
|
|
|
|
func won(b bot, s state) bool {
|
|
return b.pos == steps
|
|
}
|
|
|
|
func gameOver(s state) bool {
|
|
for _, t := range s.teams {
|
|
if t.won {
|
|
return true
|
|
}
|
|
}
|
|
return false
|
|
}
|
|
|
|
const (
|
|
steps = 40
|
|
numBots = 10
|
|
numTeams = 4
|
|
)
|