engine

package

v1.0.0 Latest Latest Go to latest Published: Apr 19, 2024 License: MIT Imports: 6 Imported by: 0

Details

Valid go.mod file

The Go module system was introduced in Go 1.11 and is the official dependency management solution for Go.
Redistributable license

Redistributable licenses place minimal restrictions on how software can be used, modified, and redistributed.
Tagged version

Modules with tagged versions give importers more predictable builds.
Stable version

When a project reaches major version v1 it is considered stable.
Learn more about best practices

Repository

github.com/ivan1993spb/snake-bot

Links

Open Source Insights

Documentation ¶

Index ¶

type Area
- func NewArea(width, height uint8) Area
- func (a Area) FindDirection(from, to types.Dot) types.Direction
- func (a Area) FitDistance(distance, divisor, gap uint8) uint8
- func (a Area) Fits(dot types.Dot) bool
- func (a Area) Navigate(dot types.Dot) []types.Dot
- func (a Area) String() string
type CacherDiscoverer
- func (d *CacherDiscoverer) Discover(head types.Dot, area Area, sight Sight, scores *HashmapSight) []types.Dot
type DijkstrasDiscoverer
- func (d *DijkstrasDiscoverer) Discover(head types.Dot, area Area, sight Sight, scores *HashmapSight) []types.Dot
type Discoverer
- func NewCacherDiscoverer(discoverer Discoverer) Discoverer
- func NewDijkstrasDiscoverer(r *rand.Rand) Discoverer
type HashmapSight
- func NewHashmapSight(s Sight) *HashmapSight
- func (h *HashmapSight) Access(dot types.Dot) (interface{}, bool)
- func (h *HashmapSight) AccessDefault(dot types.Dot, defaultValue interface{}) interface{}
- func (h *HashmapSight) Assign(dot types.Dot, v interface{})
- func (h *HashmapSight) Flush()
- func (h *HashmapSight) ForEach(f func(dot types.Dot, v interface{}))
- func (h *HashmapSight) Reflect() *HashmapSight
type Map
- func NewMap(a Area) *Map
- func (m *Map) Clear(dots []types.Dot)
- func (m *Map) GetObject(dot types.Dot) (*types.Object, bool)
- func (m *Map) LookAround(s Sight) *HashmapSight
- func (m *Map) SaveObject(object *types.Object)
type Position
type Queue
- func NewQueue() *Queue
- func (q *Queue) Enqueued(dot types.Dot) bool
- func (q *Queue) Len() int
- func (q *Queue) Less(i, j int) bool
- func (q *Queue) Pop() interface{}
- func (q *Queue) Push(x interface{})
- func (q *Queue) Swap(i, j int)
type Sight
- func NewSight(a Area, pos types.Dot, distance uint8) Sight
- func (s Sight) Absolute(relX, relY uint8) types.Dot
- func (s Sight) Dots() []types.Dot
- func (s Sight) Relative(dot types.Dot) (uint8, uint8)
- func (s Sight) Seen(dot types.Dot) bool

Constants ¶

This section is empty.

Variables ¶

This section is empty.

Functions ¶

This section is empty.

Types ¶

type Area ¶

type Area struct {
	Width  uint8
	Height uint8
}

func NewArea ¶

func NewArea(width, height uint8) Area

func (Area) FindDirection ¶

func (a Area) FindDirection(from, to types.Dot) types.Direction

func (Area) FitDistance ¶

func (a Area) FitDistance(distance, divisor, gap uint8) uint8

func (Area) Fits ¶

func (a Area) Fits(dot types.Dot) bool

func (Area) Navigate ¶

func (a Area) Navigate(dot types.Dot) []types.Dot

func (Area) String ¶

func (a Area) String() string

type CacherDiscoverer ¶

type CacherDiscoverer struct {
	// contains filtered or unexported fields
}

func (*CacherDiscoverer) Discover ¶

func (d *CacherDiscoverer) Discover(head types.Dot, area Area,
	sight Sight, scores *HashmapSight) []types.Dot

type DijkstrasDiscoverer ¶

type DijkstrasDiscoverer struct {
	// contains filtered or unexported fields
}

DijkstrasDiscoverer discoves paths. It is based on Dijkstra's algorithm.

Link: https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm

func (*DijkstrasDiscoverer) Discover ¶

func (d *DijkstrasDiscoverer) Discover(head types.Dot, area Area,
	sight Sight, scores *HashmapSight) []types.Dot

type Discoverer ¶

type Discoverer interface {
	Discover(head types.Dot, area Area, sight Sight,
		scores *HashmapSight) []types.Dot
}

func NewCacherDiscoverer ¶

func NewCacherDiscoverer(discoverer Discoverer) Discoverer

func NewDijkstrasDiscoverer ¶

func NewDijkstrasDiscoverer(r *rand.Rand) Discoverer

type HashmapSight ¶

type HashmapSight struct {
	// contains filtered or unexported fields
}

func NewHashmapSight ¶

func NewHashmapSight(s Sight) *HashmapSight

func (*HashmapSight) Access ¶

func (h *HashmapSight) Access(dot types.Dot) (interface{}, bool)

func (*HashmapSight) AccessDefault ¶

func (h *HashmapSight) AccessDefault(dot types.Dot,
	defaultValue interface{}) interface{}

func (*HashmapSight) Assign ¶

func (h *HashmapSight) Assign(dot types.Dot, v interface{})

func (*HashmapSight) Flush ¶

func (h *HashmapSight) Flush()

func (*HashmapSight) ForEach ¶

func (h *HashmapSight) ForEach(f func(dot types.Dot, v interface{}))

func (*HashmapSight) Reflect ¶

func (h *HashmapSight) Reflect() *HashmapSight

type Map ¶

type Map struct {
	// contains filtered or unexported fields
}

func NewMap ¶

func NewMap(a Area) *Map

func (*Map) Clear ¶

func (m *Map) Clear(dots []types.Dot)

func (*Map) GetObject ¶

func (m *Map) GetObject(dot types.Dot) (*types.Object, bool)

func (*Map) LookAround ¶

func (m *Map) LookAround(s Sight) *HashmapSight

func (*Map) SaveObject ¶

func (m *Map) SaveObject(object *types.Object)

type Position ¶

type Position struct {
	// contains filtered or unexported fields
}

type Queue ¶

type Queue struct {
	// contains filtered or unexported fields
}

func NewQueue ¶

func NewQueue() *Queue

func (*Queue) Enqueued ¶

func (q *Queue) Enqueued(dot types.Dot) bool

func (*Queue) Len ¶

func (q *Queue) Len() int

func (*Queue) Less ¶

func (q *Queue) Less(i, j int) bool

func (*Queue) Pop ¶

func (q *Queue) Pop() interface{}

func (*Queue) Push ¶

func (q *Queue) Push(x interface{})

func (*Queue) Swap ¶

func (q *Queue) Swap(i, j int)

type Sight ¶

type Sight struct {
	// contains filtered or unexported fields
}

func NewSight ¶

func NewSight(a Area, pos types.Dot, distance uint8) Sight

func (Sight) Absolute ¶

func (s Sight) Absolute(relX, relY uint8) types.Dot

func (Sight) Dots ¶

func (s Sight) Dots() []types.Dot

func (Sight) Relative ¶

func (s Sight) Relative(dot types.Dot) (uint8, uint8)

func (Sight) Seen ¶

func (s Sight) Seen(dot types.Dot) bool

Source Files ¶

View all Source files

?	: This menu
/	: Search site
f or F	: Jump to
y or Y	: Canonical URL