🏆 Make an AI capable of beating human players at Gomoku

Fast Forward-Only Deep Neural Network Library for the Nao Robots

pruner: Implementing the Felsenstein's Tree Pruning algorithm

Sudoku Solver that doesn't guess.

Chess Problems solved using Backtracking techniques like pruning etc.

Programing Techniques

This project involves creating, in the language of your choice, a Gomoku game integrating an AI player capable of beating a human player the fastest way possible. To do this, you will implement a min-max algorithm but also do research, trial and error to find the most adapted heuristics. This will not be as easy as checkers.

Caffe for Sparse Convolutional Neural Network

Software for the paper "dCSR: A Memory-Efficient Sparse Matrix Representation for Parallel Neural Network Inference"

gerador de grafos 3-admissíveis

An exact schedulability test for Global Fixed Priority multiprocessor scheduling by using state space pruning. A detailed description of the methods is available in the following paper: https://www.computer.org/csdl/journal/tc/5555/01/09681210/1A8cppC7d28

A fast keyboard layout optimizer for searching layout with the best metric, with sophisticated pruning and optimization techniques

Chess engine