Package ai.nettogrof.battlesnake.treesearch.search.royale.wrapped

Class WrappedRoyaleSearch

java.lang.Object

ai.nettogrof.battlesnake.treesearch.AbstractSearch

ai.nettogrof.battlesnake.treesearch.AbstractBestFirstSearch

ai.nettogrof.battlesnake.treesearch.AbstractMCTS

ai.nettogrof.battlesnake.treesearch.search.royale.AbstractRoyaleSearch

ai.nettogrof.battlesnake.treesearch.search.royale.wrapped.WrappedRoyaleSearch

All Implemented Interfaces:

Runnable

public class WrappedRoyaleSearch
extends AbstractRoyaleSearch

This regular search was used during the Spring 2022 league Nessegrev-Beta snake for the wrapped mode It start by search the smallest branch and expand it (12 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 best leaf node 3. update score of the branch keep branch info if score doesn't changed Repeat those 3 steps until no time left or the root is not more expandable.

Version:

Spring 2022

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
WrappedRoyaleSearch(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 boolean	freeSpace(int square, List<SnakeInfo> snakes, SnakeInfo currentSnake)	Check if the snake can move on the square
protected List<SnakeInfo>	generateSnakeInfoDestination(SnakeInfo snakeInfo, AbstractNode node, List<SnakeInfo> allSnakes)	Generate all moves possible for a snake given.
void	run()

Methods inherited from class ai.nettogrof.battlesnake.treesearch.search.royale.AbstractRoyaleSearch

createSnakeInfo, kill

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, getSmallestChild, merge, moveSnake, stopSearching

Methods inherited from class java.lang.Object

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

Constructor Detail

WrappedRoyaleSearch

public WrappedRoyaleSearch(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

generateSnakeInfoDestination

protected List<SnakeInfo> generateSnakeInfoDestination(SnakeInfo snakeInfo,
                                                       AbstractNode node,
                                                       List<SnakeInfo> allSnakes)

Description copied from class: AbstractSearch

Generate all moves possible for a snake given.

Overrides:

generateSnakeInfoDestination in class AbstractSearch

Parameters:

snakeInfo - Information about the snake

node - Parent node

allSnakes - List of all snakes

Returns:

list of snakeinfo

freeSpace

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

Description copied from class: AbstractSearch

Check if the snake can move on the square

Overrides:

freeSpace in class AbstractRoyaleSearch

Parameters:

square - the int sqaure

snakes - List of all snakes

currentSnake - current Snake

Returns:

boolean free to move on that square

run

public void run()