Desktop app for visualizing graph search algorithms

Optimal Connect Four with Alpha-Beta Pruning

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.

лабы по предмету СиАОД (Системы и Алгоритмы Обработки Данных)

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.

Algorithms

Am implementation of the recursive MiniMax search tree algorithm (in Python) for the purpose the development of an intelligent Checkers Player.

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.