Documentation
¶
Index ¶
- Constants
- func OrderSimple(move *goita.Move, handCounter int, partnerAttack bool) (score int)
- func Solve(board *goita.Board) chan *EvaluatedMove
- func StartNegamax(board *goita.Board, searchDepth int, eval evalFunc) chan *EvaluatedMove
- func StartNegamaxSimple(board *goita.Board, move *goita.Move, eval evalFunc, searchDepth int, ...)
- type EvaluatedMove
- type LinkedMove
- type Status
Constants ¶
View Source
const (
// MaxDepth is a limit of depth of goita
MaxDepth = 50
)
Variables ¶
This section is empty.
Functions ¶
func OrderSimple ¶
OrderSimple calculate score with simple conditions
func StartNegamax ¶
func StartNegamax(board *goita.Board, searchDepth int, eval evalFunc) chan *EvaluatedMove
StartNegamax manages negamax search goroutines
func StartNegamaxSimple ¶
func StartNegamaxSimple(board *goita.Board, move *goita.Move, eval evalFunc, searchDepth int, ch chan *EvaluatedMove)
StartNegamaxSimple run negamax search
Types ¶
type EvaluatedMove ¶
type EvaluatedMove struct {
Move *goita.Move
Score int
History goita.MoveHashArray
}
EvaluatedMove is Move data and score
func SolveSimple ¶
func SolveSimple(board *goita.Board) []EvaluatedMove
SolveSimple search the deal perfect
func (EvaluatedMove) String ¶
func (em EvaluatedMove) String() string
func (EvaluatedMove) StringHistory ¶
func (em EvaluatedMove) StringHistory(startTurn int) string
StringHistory make move+score+history string
type LinkedMove ¶
LinkedMove is considerable as a solution for reducing memory allocation of EvaluatedMove
Source Files
Click to show internal directories.
Click to hide internal directories.