Package ai.nettogrof.battlesnake.treesearch.search.constrictor

Class ConstrictorSearch

java.lang.Object

ai.nettogrof.battlesnake.treesearch.AbstractSearch

ai.nettogrof.battlesnake.treesearch.AbstractBestFirstSearch

ai.nettogrof.battlesnake.treesearch.AbstractMCTS

ai.nettogrof.battlesnake.treesearch.search.constrictor.ConstrictorSearch

All Implemented Interfaces:

Runnable

public class ConstrictorSearch
extends AbstractMCTS

This Constrictor search add the possibility to play Constrictor mode It start by search the smallest branch and expand it (256 times) then : 1. find the best branch from the previous best branch that the score doesn't change (root the first time) 2. expand the MCTS leaf node (ratio between best / less explored ) 3. update score of the branch keep branch info if score doesn't changed Repeat those 2 steps until no time left or the root is not more expandable.

Version:

Summer 2021

Author:

carl.lajeunesse

Field Summary

Fields inherited from class ai.nettogrof.battlesnake.treesearch.AbstractSearch

cont, height, root, rules, startTime, timeout, width

Constructor Summary

Constructors

Constructor	Description
ConstrictorSearch()	Basic constructor
ConstrictorSearch(AbstractNode root, int width, int height)	Constructor used to expand the tree once.
ConstrictorSearch(AbstractNode root, int width, int height, long starttime, int timeout, GameRuleset rules)	Constructor used to expand to do the tree search.

Method Summary

Modifier and Type	Method	Description
protected SnakeInfo	createSnakeInfo(SnakeInfo snake, int newHead, AbstractNode node)	Create new SnakeInfo based on the current node and the new head square
protected boolean	freeSpace(int square, List<SnakeInfo> snakes, SnakeInfo yourSnake)	Check if the snake can move on the square
protected void	kill(SnakeInfo death, List<SnakeInfo> all)	This abstract method will be use to "kill" a snake
void	run()

Methods inherited from class ai.nettogrof.battlesnake.treesearch.AbstractMCTS

executeMCTS, getMCTSBestPath

Methods inherited from class ai.nettogrof.battlesnake.treesearch.AbstractBestFirstSearch

getBestChild, getbestChildValue, getBestPath, mergeList, updateFullListNode, updateListNode

Methods inherited from class ai.nettogrof.battlesnake.treesearch.AbstractSearch

addMove, checkHeadToHead, generateChild, generateChild, generateSnakeInfoDestination, getSmallestChild, merge, moveSnake, stopSearching

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

ConstrictorSearch

public ConstrictorSearch()

Basic constructor

ConstrictorSearch

public ConstrictorSearch(AbstractNode root,
                         int width,
                         int height)

Constructor used to expand the tree once.

Parameters:

root - Root node

width - Board width

height - Board height

ConstrictorSearch

public ConstrictorSearch(AbstractNode root,
                         int width,
                         int height,
                         long starttime,
                         int timeout,
                         GameRuleset rules)

Constructor used to expand to do the tree search.

Parameters:

root - Root node

width - Board width

height - Board height

starttime - starting time for the search in millisecond

timeout - the time limit to run the search

rules - Game ruleset

Method Detail

run

public void run()

kill

protected void kill(SnakeInfo death,
                    List<SnakeInfo> all)

Description copied from class: AbstractSearch

This abstract method will be use to "kill" a snake

Specified by:

kill in class AbstractSearch

Parameters:

death - SnakeInfo of the snake to kill

all - List of all snakeinfo

createSnakeInfo

protected SnakeInfo createSnakeInfo(SnakeInfo snake,
                                    int newHead,
                                    AbstractNode node)

Description copied from class: AbstractSearch

Create new SnakeInfo based on the current node and the new head square

Specified by:

createSnakeInfo in class AbstractSearch

Parameters:

snake - previous snakeInfo

newHead - New head square

node - Previous node

Returns:

new SnakeInfo

freeSpace

protected boolean freeSpace(int square,
                            List<SnakeInfo> snakes,
                            SnakeInfo yourSnake)

Description copied from class: AbstractSearch

Check if the snake can move on the square

Specified by:

freeSpace in class AbstractSearch

Parameters:

square - the int sqaure

snakes - List of all snakes

yourSnake - current Snake

Returns:

boolean free to move on that square