tslocum/bgammon
tslocum/bgammon
2
0
Fork 0
Code Issues 11 Pull requests Projects Releases Wiki Activity

Skip previously found moves when calculating legal moves

Browse source
This commit is contained in:
Trevor Slocum 2023-11-01 23:15:36 -07:00
parent 41fa0a24b0
commit 171948e21c
1 changed files with 16 additions and 21 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

37
game.go
View file

@ -385,6 +385,7 @@ func (g *Game) LegalMoves(local bool) [][]int {
}
var moves [][]int
var movesFound = make(map[int]bool)
var mustEnter bool
var barSpace int
@ -398,19 +399,17 @@ func (g *Game) LegalMoves(local bool) [][]int {
if mustEnter { // Must enter from bar.
from, to := HomeRange(g.opponentPlayer().Number)
g.iterateSpaces(from, to, func(homeSpace int, spaceCount int) {
if movesFound[barSpace*100+homeSpace] {
return
}
available := haveDiceRoll(barSpace, homeSpace)
if available == 0 {
return
}
opponentCheckers := OpponentCheckers(g.Board[homeSpace], g.Turn)
if opponentCheckers <= 1 {
movable := PlayerCheckers(g.Board[barSpace], g.Turn)
if movable > available {
movable = available
}
for i := 0; i < movable; i++ {
moves = append(moves, []int{barSpace, homeSpace})
}
moves = append(moves, []int{barSpace, homeSpace})
movesFound[barSpace*100+homeSpace] = true
}
})
} else {
@ -433,6 +432,9 @@ func (g *Game) LegalMoves(local bool) [][]int {
if g.Turn == 2 {
homeSpace = SpaceHomeOpponent
}
if movesFound[space*100+homeSpace] {
continue
}
available := haveBearOffDiceRoll(SpaceDiff(space, homeSpace))
if available > 0 {
ok := true
@ -455,13 +457,8 @@ func (g *Game) LegalMoves(local bool) [][]int {
}
}
if ok {
movable := playerCheckers
if movable > available {
movable = available
}
for i := 0; i < movable; i++ {
moves = append(moves, []int{space, homeSpace})
}
moves = append(moves, []int{space, homeSpace})
movesFound[space*100+homeSpace] = true
}
}
}
@ -473,6 +470,9 @@ func (g *Game) LegalMoves(local bool) [][]int {
}
g.iterateSpaces(space, lastSpace, func(to int, spaceCount int) {
if movesFound[space*100+to] {
return
}
available := haveDiceRoll(space, to)
if available == 0 {
return
@ -480,13 +480,8 @@ func (g *Game) LegalMoves(local bool) [][]int {
opponentCheckers := OpponentCheckers(g.Board[to], g.Turn)
if opponentCheckers <= 1 {
movable := playerCheckers
if movable > available {
movable = available
}
for i := 0; i < movable; i++ {
moves = append(moves, []int{space, to})
}
moves = append(moves, []int{space, to})
movesFound[space*100+to] = true
}
})
}