Artificial Intelligence I: Meta-Heuristics and Games in Java

This course is about the fundamental concepts of artificial intelligence. This topic is getting very hot nowadays because these learning algorithms can be used in several fields from software engineering to investment banking. Learning algorithms can recognize patterns which can help detecting cancer for example. We may construct algorithms that can have a very  good guess about stock price movement in the market. - PATHFINDING ALGORITHMS -Section 1 - Breadth-First Search (BFS)what is breadth-first search algorithmwhy to use graph algorithms in AISection 2 - Depth-First Search (DFS)what is depth-first search algorithmimplementation with iteration and with recursiondepth-first search stack memory visualizationmaze escape applicationSection 3 - Iterative Deepening Depth-First Search (IDDFS)what is iterative deepening depth-first search algorithmSection 4 - A* Search Algorithmwhat is A* search algorithmwhat is the difference between Dijkstra's algorithm and A* searchwhat is a heuristicManhattan distance and Euclidean distance - OPTIMIZATION -Section 5 - Optimization Approachesbasic optimization algorithmsbrute-force searchhill climbing algorithm- META-HEURISTICS -Section 6 - Simulated Annealingwhat is simulated annealinghow to find the extremum of functionshow to solve combinatorial optimization problemstravelling salesman problem (TSP)Section 7 - Genetic Algorithmswhat are genetic alg