This repo has algorithms I learned during AI Course

Uses iterative state formulation

• Breadth First Search
• Depth First Search
• Depth Limit Search
• Uniform Cost Search

Uses complete state formulation

• A* Search - Using f(n) = g(n) h(n) as evaluation function in Uniform Cost Search

Uses complete state formulation

• Hill Climbing - Greedy local search optimization algorithm
• Simulated Annealing
• Genetic Algorithm

Reference - tonypoer.io

• Minimax Algorithm
• AlphaBeta Pruning

Some of the popular AI Problems are coded to instantiate Above mentioned algorithms

• NQueen Problem - NQueen for Genetic Algorithm
• Problem Of Romania - Coming soon
• Tic-Tac-Toe - Used as problems including multiple agent: Minimax & AlphaBeta Pruning

Coming Soon!!!

Create a DialogFlow API Access token and place it in the code

And use your facebook credential here