Science paper that analyses potential optimisations/early abort criteria to tree based solutions in game-theory.

Implementation of Trees and their basic functionalities in C.

This Tree-Based Search Algorithms for Pathfinding implement DFS, BFS, RS, A*, and GBFS algorithms. The project assesses performance, heuristics, and optimizations while visually demonstrating algorithm behaviour.

Contains Python code for various assignments and leetcode problems related to data structures and algorithms.

Implementation of various tree search algorithms with the goal of creating a chess bot

TBA

Complete University Cores Select System Developed in c++ . for data struct cores in 2008 . used tree search and class in this project.

handle list ,nested list tree

Parallelization of the tree search algorithm using OpenMP.

Graphs and trees

⌨️ Comparar os resultados de algoritmos de Machine Learning com problemas de classificação. Escolher três problemas de classificação do UCI

Monte Carlo Tree Search module for general game playing, as well as some concrete implementations of agents for specific games.

Using Artificial Intelligence to solve digdug levels.

A simple python class for search in binary tree. This class provides a few methods for searching in binary tree. Search methods are recursive and non-recursive. You can easily search in binary tree with only on left or right child, and you can search in binary tree with both left and right child.

Implementation of a binary tree in Go. A Binary Tree is a tree data structure in which each node has at most two children, which are referred to as the left child and the right child. A node with no children is called a leaf node. A node cannot have more than two children.

Курс "Теория Графов", проводимый в рамках факультетского дня лицея НИУ ВШЭ на ФКН

Trabalho da professora Cinthia Caliari

🚕 Explore the world of Monte Carlo Control, Monte Carlo Tree Search, and Rapid Action Value Estimation in this interactive tutorial tailored to the Taxi domain. Dive into detailed visual demos, accompanied by a comprehensive table tracking algorithmic metrics at each step. Perfect for beginners and enthusiasts alike!