Desktop app for visualizing graph search algorithms
Optimal Connect Four with Alpha-Beta Pruning
The use of the PRIM algorithm to find a minimum spanning tree. The program uses the selected database in CSV format and converts it into a graph to find the minimum spanning tree through the Prim's Algorithm. The chosen database needed to be transformable into a connected, weighted, and undirected graph to ensure error-free processing.
Tarefas para o aprendizado de algoritmos, da cadeira Algoritmo e Estrutura de Dados do curso de Sistemas de Informação (SI) do CIn da UFPE, cadeira cursada por mim em 2023.
Algorithms
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.
лабы по предмету СиАОД (Системы и Алгоритмы Обработки Данных)
A Battlesnake program that implements the MaxN version of the Minimax algorithm and a separate program that implements a genetic algorithm for optimizing a set of parameters in the MaxN algorithm.
A list of usefull algoritms to be used as code examples
Am implementation of the recursive MiniMax search tree algorithm (in Python) for the purpose the development of an intelligent Checkers Player.
Add a description, image, and links to the search-tree topic page so that developers can more easily learn about it.
To associate your repository with the search-tree topic, visit your repo's landing page and select "manage topics."