Pinned Repositories
Battleship
It is the famous game Battleship (multiplayer)
Gestion-de-asignaturas-mediante-arboles-binarios-ordenados
Gestion-de-asignaturas-mediante-listas-doblemente-enlazadas-ordenadas
Gestion-de-stock
Un sistema simple de gestión de inventario
Minesweeper
This was the first game I did without any help. I did it while studying the first course of Computer Engineering
Multiple-Quadratic-Knapsack-Problem-using-Global-Search
This is a program that use four kinds of global search to solve the Multiple Quadratic Knapsack Problem. The used types of global search are Simulated Annealing, Tabu Search, GRASP and Iterated Greedy.
Multiple-Quadratic-Knapsack-Problem-using-Local-Search
This is a program that use two kinds of local search to solve the Multiple Quadratic Knapsack Problem. The used types of local search are Simple Search and Search by Maximun Slope.
Multiple-Quadratic-Knapsack-Problem-using-Population-based-Metaheuristics
This is a program that use two metaheuristics to solve the Multiple Quadratic Knapsack Problem. The used metaheuristics are a Genetic Algorithm and the Ant Colony Optimization.
Multiple-Quadratic-Knapsack-Problem-using-Random-Search
This is a program that use a random search to solve the Multiple Quadratic Knapsack Problem.
TwitchPy
TwitchPy is a Python package for using the Twitch's API and create bots for interacting with their IRC chats.
DaCasBe's Repositories
DaCasBe/TwitchPy
TwitchPy is a Python package for using the Twitch's API and create bots for interacting with their IRC chats.
DaCasBe/Multiple-Quadratic-Knapsack-Problem-using-Population-based-Metaheuristics
This is a program that use two metaheuristics to solve the Multiple Quadratic Knapsack Problem. The used metaheuristics are a Genetic Algorithm and the Ant Colony Optimization.
DaCasBe/Multiple-Quadratic-Knapsack-Problem-using-Global-Search
This is a program that use four kinds of global search to solve the Multiple Quadratic Knapsack Problem. The used types of global search are Simulated Annealing, Tabu Search, GRASP and Iterated Greedy.
DaCasBe/Multiple-Quadratic-Knapsack-Problem-using-Local-Search
This is a program that use two kinds of local search to solve the Multiple Quadratic Knapsack Problem. The used types of local search are Simple Search and Search by Maximun Slope.
DaCasBe/Multiple-Quadratic-Knapsack-Problem-using-Random-Search
This is a program that use a random search to solve the Multiple Quadratic Knapsack Problem.
DaCasBe/Gestion-de-asignaturas-mediante-arboles-binarios-ordenados
DaCasBe/Gestion-de-asignaturas-mediante-listas-doblemente-enlazadas-ordenadas
DaCasBe/Minesweeper
This was the first game I did without any help. I did it while studying the first course of Computer Engineering
DaCasBe/Battleship
It is the famous game Battleship (multiplayer)
DaCasBe/Gestion-de-stock
Un sistema simple de gestión de inventario
DaCasBe/Pac-Man
The classic Pac-Man video game. It is necessary to have the allegro.h library.
DaCasBe/Pong
It is the famous game Pong
DaCasBe/Snake
It is the famous game Snake
DaCasBe/Spaceship-Game
This is a game about a ship that has to dodge asteroids or destroy them for scoring points