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.

This is a Go program for creating a complete tree using linked list. You can easily insert nodes to the tree and print it. This library provide two inserting functions. One of them is for inserting nodes to the tree by filling the tree from left to right in per row. and the next one is to insert to left side of the tree.

Integrated task and motion planning using grounded actions learned from observing expert demonstrations.

TBA

Simple Console Snake Game

Simple implementation of 2048 in python. Command line and pygame interface.

Manipulating the Tree Structure.

DOTS-Benchmark is a suite to evaluate algorithms for complex system optimisation.

A library of fundamental algorithms and data structures written in C

Basic chess simulator with PyChess

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

The tree search algorithm used to solve a dynamic lot-size problem in the paper by Baker et al.

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

Monte-Carlo tree search for reversi

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

Parallelization of the tree search algorithm using OpenMP.

Search algorithms for 8-puzzle problem search problem and traveling salesman optimization problem.