Uses of Class
ai.nettogrof.battlesnake.treesearch.node.AbstractNode

Packages that use AbstractNode

Package	Description
ai.nettogrof.battlesnake.snakes	This package contains all "Snakes" classes
ai.nettogrof.battlesnake.treesearch	Contains everything related to tree search
ai.nettogrof.battlesnake.treesearch.node	Contain Abstract Node class
ai.nettogrof.battlesnake.treesearch.search.constrictor	Contains search and node classes related to constrictor mode
ai.nettogrof.battlesnake.treesearch.search.fun	Contains fun search to prevent our snake to do certain things
ai.nettogrof.battlesnake.treesearch.search.royale	Contains search and node classes related to royale mode
ai.nettogrof.battlesnake.treesearch.search.royale.wrapped
ai.nettogrof.battlesnake.treesearch.search.squad	Contains search and node classes related to squad mode
ai.nettogrof.battlesnake.treesearch.search.standard	Contains search and node classes related to standard mode

Uses of AbstractNode in ai.nettogrof.battlesnake.snakes

Fields in ai.nettogrof.battlesnake.snakes declared as AbstractNode

Modifier and Type	Field	Description
protected AbstractNode	AbstractTreeSearchSnakeAI.lastRoot	Keep the root node from the previous move, to be able to continue search from the previous "tree"

Methods in ai.nettogrof.battlesnake.snakes that return AbstractNode

Modifier and Type	Method	Description
private AbstractNode	AbstractSearchSnakeAI.checkWinLost(AbstractNode winner, AbstractNode root, Map<String,String> response)	Check if it's a win or lost
protected AbstractNode	AbstractTreeSearchSnakeAI.chooseBestMove(AbstractNode root)	Choose the best move, based on the assumption that the opponent will always choose the best counter.
protected AbstractNode	AbstractTreeSearchSnakeAI.findChildNewRoot(List<SnakeInfo> snakes, FoodInfo food, HazardSquare hazard)	Check in the previous search if a child from root, is equals the current board situation.,
protected abstract AbstractNode	AbstractSearchSnakeAI.finishHim(AbstractNode root, AbstractNode winner)	In a winning position, this method try to find the shortest way to win.
protected AbstractNode	AbstractTreeSearchSnakeAI.finishHim(AbstractNode root, AbstractNode winner)	In a winning position, this method try to find the shortest way to win.
protected AbstractNode	ExpertSnake.genNode(List<SnakeInfo> snakes, FoodInfo food, HazardSquare hazard)	This method generate the root node type
protected abstract AbstractNode	AbstractTreeSearchSnakeAI.genRoot(com.fasterxml.jackson.databind.JsonNode moveRequest)	Generate the root node based on the /move request
protected AbstractNode	ExpertSnake.genRoot(com.fasterxml.jackson.databind.JsonNode moveRequest)	Generate the root node based on the /move request
protected abstract AbstractNode	AbstractSearchSnakeAI.lastChance(AbstractNode root)	In a losing position, this method try to find the longest way, hpoing that the opponent make a mistake.
protected AbstractNode	AbstractTreeSearchSnakeAI.lastChance(AbstractNode root)	In a losing position, this method try to find the longest way, hpoing that the opponent make a mistake.

Methods in ai.nettogrof.battlesnake.snakes with parameters of type AbstractNode

Modifier and Type	Method	Description
private AbstractNode	AbstractSearchSnakeAI.checkWinLost(AbstractNode winner, AbstractNode root, Map<String,String> response)	Check if it's a win or lost
protected AbstractNode	AbstractTreeSearchSnakeAI.chooseBestMove(AbstractNode root)	Choose the best move, based on the assumption that the opponent will always choose the best counter.
private void	AbstractTreeSearchSnakeAI.fillList(gnu.trove.list.array.TFloatArrayList[] upward, gnu.trove.list.array.TFloatArrayList[] down, gnu.trove.list.array.TFloatArrayList[] left, gnu.trove.list.array.TFloatArrayList[] right, AbstractNode node)	This method fill 4 list (one for each direction ) with the score of each node based on the move direction
protected abstract AbstractNode	AbstractSearchSnakeAI.finishHim(AbstractNode root, AbstractNode winner)	In a winning position, this method try to find the shortest way to win.
protected AbstractNode	AbstractTreeSearchSnakeAI.finishHim(AbstractNode root, AbstractNode winner)	In a winning position, this method try to find the shortest way to win.
protected Map<String,String>	AbstractSearchSnakeAI.generateResponse(AbstractNode winner, AbstractNode root, com.fasterxml.jackson.databind.JsonNode head)	Generate the response to send, adding a shout if in winning/losing position.
private int	AbstractTreeSearchSnakeAI.getMaxDepth(AbstractNode root)	Check the depth of the biggest branch
protected abstract AbstractNode	AbstractSearchSnakeAI.lastChance(AbstractNode root)	In a losing position, this method try to find the longest way, hpoing that the opponent make a mistake.
protected AbstractNode	AbstractTreeSearchSnakeAI.lastChance(AbstractNode root)	In a losing position, this method try to find the longest way, hpoing that the opponent make a mistake.
protected void	AbstractMultiThreadSnakeAI.multiThreadtreeSearch(AbstractNode root, Long startTime, GameRuleset rules)	Execute the multiThread tree search
void	AbstractTreeSearchSnakeAI.singleThreadTreeSearch(AbstractNode root, Long startTime, GameRuleset rules)	Execute the single Thread tree search
protected void	AbstractMultiThreadSnakeAI.treeSearch(AbstractNode root, Long startTime, GameRuleset rules)	Execute the tree search
protected void	AbstractTreeSearchSnakeAI.treeSearch(AbstractNode root, Long startTime, GameRuleset rules)	Execute the tree search

Method parameters in ai.nettogrof.battlesnake.snakes with type arguments of type AbstractNode

Modifier and Type	Method	Description
protected void	AbstractMultiThreadSnakeAI.expand(List<AbstractNode> nodelist, List<AbstractNode> expandedlist, GameRuleset rules)	Expand the base list of node until reaching CPU limit

Uses of AbstractNode in ai.nettogrof.battlesnake.treesearch

Fields in ai.nettogrof.battlesnake.treesearch declared as AbstractNode

Modifier and Type	Field	Description
protected AbstractNode	AbstractSearch.root	Root node for the search

Methods in ai.nettogrof.battlesnake.treesearch that return AbstractNode

Modifier and Type	Method	Description
AbstractNode	AbstractBestFirstSearch.getBestChild(AbstractNode node)	This method find and return the best leaf node
protected AbstractNode	AbstractSearch.getSmallestChild(AbstractNode node)	Get the leaf from the smallest branch
private AbstractNode	AbstractBestFirstSearch.getWinnerChild(AbstractNode node)	Get the best child/winner from a node

Methods in ai.nettogrof.battlesnake.treesearch that return types with arguments of type AbstractNode

Modifier and Type	Method	Description
protected List<AbstractNode>	AbstractBestFirstSearch.getBestPath(AbstractNode node)	This method is use to find the next leaf node to explore using MCTS algo
protected List<AbstractNode>	AbstractMCTS.getMCTSBestPath(AbstractNode node)	This method is use to find the next leaf node to explore using MCTS algo
protected List<AbstractNode>	AbstractBestFirstSearch.updateListNode(List<AbstractNode> branch)	This method get a branch, update score starting from the leaf.

Methods in ai.nettogrof.battlesnake.treesearch with parameters of type AbstractNode

Modifier and Type	Method	Description
protected void	AbstractSearch.addMove(int newhead, List<SnakeInfo> allSnakes, SnakeInfo snakeInfo, AbstractNode node, List<SnakeInfo> listNewSnakeInfo)	This method add move to the list if the snake can move in the new head position.
protected abstract SnakeInfo	AbstractSearch.createSnakeInfo(SnakeInfo snakeInfo, int newHead, AbstractNode node)	Create new SnakeInfo based on the current node and the new head square
private void	AbstractBestFirstSearch.fillList(gnu.trove.list.array.TFloatArrayList upward, gnu.trove.list.array.TFloatArrayList down, gnu.trove.list.array.TFloatArrayList left, gnu.trove.list.array.TFloatArrayList right, AbstractNode node)	This method fill 4 list (one for each direction ) with the score of each node based on the move direction
private void	AbstractMCTS.fillMCTSList(gnu.trove.list.array.TFloatArrayList upward, gnu.trove.list.array.TFloatArrayList down, gnu.trove.list.array.TFloatArrayList left, gnu.trove.list.array.TFloatArrayList right, AbstractNode node)	This method fill 4 list (one for each direction ) with the score of each node based on the move direction
protected void	AbstractSearch.generateChild(AbstractNode node)	Expand / Generate child from a node
protected List<SnakeInfo>	AbstractSearch.generateSnakeInfoDestination(SnakeInfo snakeInfo, AbstractNode node, List<SnakeInfo> allSnakes)	Generate all moves possible for a snake given.
AbstractNode	AbstractBestFirstSearch.getBestChild(AbstractNode node)	This method find and return the best leaf node
protected List<AbstractNode>	AbstractBestFirstSearch.getBestPath(AbstractNode node)	This method is use to find the next leaf node to explore using MCTS algo
protected List<AbstractNode>	AbstractMCTS.getMCTSBestPath(AbstractNode node)	This method is use to find the next leaf node to explore using MCTS algo
protected AbstractNode	AbstractSearch.getSmallestChild(AbstractNode node)	Get the leaf from the smallest branch
private AbstractNode	AbstractBestFirstSearch.getWinnerChild(AbstractNode node)	Get the best child/winner from a node
private float	AbstractMCTS.mctsScore(AbstractNode parentNode, AbstractNode childNode)	Calculation of the Upper Confident Bound score.
protected void	AbstractSearch.moveSnake(SnakeInfo snakeInfo, AbstractNode node, List<SnakeInfo> allSnakes, List<SnakeInfo> listNewSnakeInfo)	Generate move of a snake

Method parameters in ai.nettogrof.battlesnake.treesearch with type arguments of type AbstractNode

Modifier and Type	Method	Description
protected void	AbstractBestFirstSearch.mergeList(List<AbstractNode> tree, List<AbstractNode> branch)	This method just merge two lists and remove the duplicate node
protected void	AbstractBestFirstSearch.updateFullListNode(List<AbstractNode> tree)	This method updateScore from each node
protected List<AbstractNode>	AbstractBestFirstSearch.updateListNode(List<AbstractNode> branch)	This method get a branch, update score starting from the leaf.

Uses of AbstractNode in ai.nettogrof.battlesnake.treesearch.node

Subclasses of AbstractNode in ai.nettogrof.battlesnake.treesearch.node

Modifier and Type	Class	Description
class	AbstractDecisionNode	This abstract node class is the based of all node class, provide basic update Score Currently using Paranoid only, I hope to add MaxN soon
class	AbstractEvaluationNode	This abstract evaluation node class is the based of all node class methods evaluation, provide evaluation method use in any node.

Fields in ai.nettogrof.battlesnake.treesearch.node with type parameters of type AbstractNode

Modifier and Type	Field	Description
protected List<AbstractNode>	AbstractNode.child	List of child node

Methods in ai.nettogrof.battlesnake.treesearch.node that return AbstractNode

Modifier and Type	Method	Description
abstract AbstractNode	AbstractNode.createNode(List<SnakeInfo> snakes, AbstractNode currentNode)	Create a node from the same type
static AbstractNode	NodeUtil.getBestNode(AbstractNode node)	Get the best child
static AbstractNode	NodeUtil.getSmallestNode(AbstractNode root)	Return the small child (in size) that are still expendable

Methods in ai.nettogrof.battlesnake.treesearch.node that return types with arguments of type AbstractNode

Modifier and Type	Method	Description
List<AbstractNode>	AbstractNode.getChild()	Gets list of child from this node

Methods in ai.nettogrof.battlesnake.treesearch.node with parameters of type AbstractNode

Modifier and Type	Method	Description
void	AbstractNode.addChild(AbstractNode newChild)	Add a child to this node
abstract AbstractNode	AbstractNode.createNode(List<SnakeInfo> snakes, AbstractNode currentNode)	Create a node from the same type
static AbstractNode	NodeUtil.getBestNode(AbstractNode node)	Get the best child
static AbstractNode	NodeUtil.getSmallestNode(AbstractNode root)	Return the small child (in size) that are still expendable

Uses of AbstractNode in ai.nettogrof.battlesnake.treesearch.search.constrictor

Subclasses of AbstractNode in ai.nettogrof.battlesnake.treesearch.search.constrictor

Modifier and Type	Class	Description
class	ConstrictorNode	This Constrictor node class must be use only in constrictor mode.

Methods in ai.nettogrof.battlesnake.treesearch.search.constrictor that return AbstractNode

Modifier and Type	Method	Description
AbstractNode	ConstrictorNode.createNode(List<SnakeInfo> snakes, AbstractNode currentNode)	Uses to create constrictor node

Methods in ai.nettogrof.battlesnake.treesearch.search.constrictor with parameters of type AbstractNode

Modifier and Type	Method	Description
AbstractNode	ConstrictorNode.createNode(List<SnakeInfo> snakes, AbstractNode currentNode)	Uses to create constrictor node
protected SnakeInfo	ConstrictorSearch.createSnakeInfo(SnakeInfo snake, int newHead, AbstractNode node)

Constructors in ai.nettogrof.battlesnake.treesearch.search.constrictor with parameters of type AbstractNode

Constructor	Description
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.

Uses of AbstractNode in ai.nettogrof.battlesnake.treesearch.search.fun

Methods in ai.nettogrof.battlesnake.treesearch.search.fun with parameters of type AbstractNode

Modifier and Type	Method	Description
protected SnakeInfo	LimitedMoveRoyaleSearch.createSnakeInfo(SnakeInfo snake, int newHead, AbstractNode currentNode)
protected List<SnakeInfo>	LimitedMoveRoyaleSearch.generateSnakeInfoDestination(SnakeInfo snakeInfo, AbstractNode node, List<SnakeInfo> allSnakes)	Generate all moves possible for a snake given.
protected void	LimitedMoveRoyaleSearch.selfDestination(int head, List<SnakeInfo> allSnakes, SnakeInfo snakeInfo, AbstractNode node, List<SnakeInfo> listNewSnakeInfo)	Generate all move possible for our snake, and check the snake direction to prevent some move.

Constructors in ai.nettogrof.battlesnake.treesearch.search.fun with parameters of type AbstractNode

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

Uses of AbstractNode in ai.nettogrof.battlesnake.treesearch.search.royale

Subclasses of AbstractNode in ai.nettogrof.battlesnake.treesearch.search.royale

Modifier and Type	Class	Description
class	AbstractRoyaleNode	This abstract royale node class is the based of all node class, provide basic method use in any node for royale rules.
class	RoyaleDuelNode	This Royale Duel node class must be use when only 2 snakes left, and in royale mode.
class	RoyaleFourNode	This Royale FourNode class must be use when only 3 or 4 snakes left, and in royale mode.

Methods in ai.nettogrof.battlesnake.treesearch.search.royale that return AbstractNode

Modifier and Type	Method	Description
AbstractNode	RoyaleDuelNode.createNode(List<SnakeInfo> snakeInfo, AbstractNode currentNode)	Uses to create royale duel node
AbstractNode	RoyaleFourNode.createNode(List<SnakeInfo> snakeInfo, AbstractNode currentNode)	Uses to create fourNode type

Methods in ai.nettogrof.battlesnake.treesearch.search.royale with parameters of type AbstractNode

Modifier and Type	Method	Description
AbstractNode	RoyaleDuelNode.createNode(List<SnakeInfo> snakeInfo, AbstractNode currentNode)	Uses to create royale duel node
AbstractNode	RoyaleFourNode.createNode(List<SnakeInfo> snakeInfo, AbstractNode currentNode)	Uses to create fourNode type
protected SnakeInfo	AbstractRoyaleSearch.createSnakeInfo(SnakeInfo snake, int newHead, AbstractNode currentNode)

Constructors in ai.nettogrof.battlesnake.treesearch.search.royale with parameters of type AbstractNode

Constructor	Description
AbstractRoyaleSearch(AbstractNode root, int width, int height, long starttime, int timeout, GameRuleset rules)	Constructor used to expand to do the tree search.
RoyaleSearch(AbstractNode root, int width, int height, long starttime, int timeout, GameRuleset rules)	Constructor used to expand to do the tree search.

Uses of AbstractNode in ai.nettogrof.battlesnake.treesearch.search.royale.wrapped

Subclasses of AbstractNode in ai.nettogrof.battlesnake.treesearch.search.royale.wrapped

Modifier and Type	Class	Description
class	WrappedRoyaleNode	This Royale FourNode class must be use when only 3 or 4 snakes left, and in royale mode.

Methods in ai.nettogrof.battlesnake.treesearch.search.royale.wrapped that return AbstractNode

Modifier and Type	Method	Description
AbstractNode	WrappedRoyaleNode.createNode(List<SnakeInfo> snakes, AbstractNode currentNode)

Methods in ai.nettogrof.battlesnake.treesearch.search.royale.wrapped with parameters of type AbstractNode

Modifier and Type	Method	Description
AbstractNode	WrappedRoyaleNode.createNode(List<SnakeInfo> snakes, AbstractNode currentNode)
protected List<SnakeInfo>	WrappedRoyaleSearch.generateSnakeInfoDestination(SnakeInfo snakeInfo, AbstractNode node, List<SnakeInfo> allSnakes)

Constructors in ai.nettogrof.battlesnake.treesearch.search.royale.wrapped with parameters of type AbstractNode

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

Uses of AbstractNode in ai.nettogrof.battlesnake.treesearch.search.squad

Subclasses of AbstractNode in ai.nettogrof.battlesnake.treesearch.search.squad

Modifier and Type	Class	Description
class	SquadNode	This Squad node class must be in squad mode

Methods in ai.nettogrof.battlesnake.treesearch.search.squad that return AbstractNode

Modifier and Type	Method	Description
AbstractNode	SquadNode.createNode(List<SnakeInfo> snakes, AbstractNode currentNode)

Methods in ai.nettogrof.battlesnake.treesearch.search.squad with parameters of type AbstractNode

Modifier and Type	Method	Description
AbstractNode	SquadNode.createNode(List<SnakeInfo> snakes, AbstractNode currentNode)
protected SnakeInfo	AbstractSquadSearch.createSnakeInfo(SnakeInfo snake, int newHead, AbstractNode currentNode)
protected SnakeInfo	SquadSearch.createSnakeInfo(SnakeInfo currentSnake, int newHead, AbstractNode node)

Constructors in ai.nettogrof.battlesnake.treesearch.search.squad with parameters of type AbstractNode

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

Uses of AbstractNode in ai.nettogrof.battlesnake.treesearch.search.standard

Subclasses of AbstractNode in ai.nettogrof.battlesnake.treesearch.search.standard

Modifier and Type	Class	Description
class	DuelNode	This Duel node class must be use when only 2 snakes left, and in standard mode.
class	FourNode	This FourNode class must be use when only 3 or 4 snakes left, and in standard mode.
class	ManyNode	This ManyNode class must be use when more than 4 snakes left, and in standard mode.

Methods in ai.nettogrof.battlesnake.treesearch.search.standard that return AbstractNode

Modifier and Type	Method	Description
AbstractNode	DuelNode.createNode(List<SnakeInfo> snakes, AbstractNode currentNode)	Uses to create duel node
AbstractNode	FourNode.createNode(List<SnakeInfo> snakes, AbstractNode currentNode)	Uses to create fourNode type
AbstractNode	ManyNode.createNode(List<SnakeInfo> snakes, AbstractNode currentNode)	Uses to create ManyNode type

Methods in ai.nettogrof.battlesnake.treesearch.search.standard with parameters of type AbstractNode

Modifier and Type	Method	Description
AbstractNode	DuelNode.createNode(List<SnakeInfo> snakes, AbstractNode currentNode)	Uses to create duel node
AbstractNode	FourNode.createNode(List<SnakeInfo> snakes, AbstractNode currentNode)	Uses to create fourNode type
AbstractNode	ManyNode.createNode(List<SnakeInfo> snakes, AbstractNode currentNode)	Uses to create ManyNode type
protected SnakeInfo	AbstractStandardSearch.createSnakeInfo(SnakeInfo snake, int newHead, AbstractNode node)

Constructors in ai.nettogrof.battlesnake.treesearch.search.standard with parameters of type AbstractNode

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