This project aims to solve the 3x3 slider puzzle using different informed and uninformed search algorithms. The problem consists of a combination puzzle that challenges a player to slide pieces along certain routes to establish a certain end-configuration.
This project aims to solve the 0-1 Knapsack Problem using Genetic Algorithms. The Knapsack Problem is an example of a combinatorial optimization problem, which seeks to maximize the benefit of objects in a knapsack without exceeding its capacity.
This project aims to solve different problems using a variety of neural networks strategies. It makes use of:
- Simple Perceptron
- Linear Perceptron
- Non-Linear Perceptron
- Multilayer Perceptron
This project aims to solve different problems using a variety unsupervised machine learning algorithms. It makes use of:
- Kohonen Networks
- Oja Rule
- Hopfield Networks