Package algorithm
package algorithm
Search techniques based on B* and various utility classes used primarily by these search techniques.
-
ClassDescriptionThis class implements B* with a few additional modifications: if the number of back-ups without leading back to the root reaches 1000, the algorithm is forced to back-up to the root if a terminal node is selected, the algorithm is forced to back-up to the root if the current node's best child is not its least pessimistic child, there is a 30% chance that the least pessimistic child is selected, this will not occur if this would select a terminal nodeDisprove-Best B*, as described in the report https://github.com/Pascalos99/ReportNewAdvancesInBstar/blob/main/Anema2025.pdfA B*² implementation which uses Disprove-Best B* at the first-level search only.BstarSquaredDB.L1Position<P extends IGamePosition<P>>This implements B*²-logistic with the `dispose all' bounds preservation technique and no shallow or deep irrelevance.BstarSquaredSimple.L1Position<P extends IGamePosition<P>>This implements B*²-max with the `dispose all' bounds preservation technique and no shallow or deep irrelevance.BstarSquaredSimpleMax.L1Position<P extends IGamePosition<P>>Deprecated.BstarSquaredVariant.L1Position<P extends IGamePosition<P>>A simple debug class.Deprecated.This is the df-B* implementation applied in the thesis.This implementation of df-B* with initial node selection inspired by B* Disprove-Best, but not exactly following it.This implementation of df-B* applies concepts from B* Disprove-Best into the internal node selection procedure.General interface for all search algorithms.The limits imposed on the search.Encapsulates the results and metrics captured from an adversarial tree search.This represents a search algorithm which primarily stores search results in a transposition table.This represents a search algorithm which can search a given tree and modify it during search.A stop condition for B* search.The heuristic function for determining the strategy at the root of any B* search.A very minimal transposition table implementation for df-B*.