The problem of maze search is solved using 3 different algorithm:

-	Breadth first search

-	Greedy Best first search

-	A* (A star) search

The simulation is drawn and one can see the algorithm working realtime

Custom length-bit string representation of a float number

For mutation flipping of random bit is used

For crossover two bitstrings are split and mixed at random point

Equation:

Can be interpreted as:

And by using matlabs GA solver from optimtool, we can find solution to the problem.

Using the Matlab's NeuralNetwork toolbox, 4 parity function is implemented

Also custom function is implemented, including the Simulink model of a trained network:

In WireWorld cellular automata, custom digital circuit is implemented: The file opens in Golly application for cellular automata simulation

Partition is done both with Kernighan Lin algorithm and Simulated Annealing