We usually want to know the shortest/fastest route between two points. This is a well-known problem in graph theory. There are several algorithms that solve this problem: A*, Dijkstra, etc.
I have implemented in C++ those algorithms and a graph of the roads in California.
Continue reading “Pathfinding Algorithms”
Recurrent algorithms C++ and Python
I have been working on recurrent algorithms. They’re a bunch of examples in which you can implement these algorithms. However, we usually see that they are efficient.
Connect 4 is a simple game that can be easily programmed and solved to win every time. I have made in Python an AI that solves and wins. It is not programmed in C++ because I wanted a GUI.
Continue reading “Connect 4 AI Solver”
I have done a project for my math class where we analyze the linear systems. We have classified the first and second-order linear systems and give a general formula for an n-linear system. We have used algebra notation and we have encountered with the companion matrix power to the n problem.
The n-linear systems are used widely in finance for loans, interests, etc.
PDF download: N-LinearDynamicSystem
GitHub repository: DynamicSystem