AI-Programming-using-Python - GitLite

KO | EN

gitlite — search

#python #hacktoberfest #ai #llm #golang #go #machine-learning #docker #macos #java #awesome #pytorch #ios #openai

AI-Programming-using-Python

(★ 75)

This repository contains implementation of different AI algorithms, based on the 4th edition of amazing AI Book, Artificial Intelligence A Modern Approach

파일 탐색기

최종 버전 다운로드 (.zip)

- ir.csv
- - .DS_Store
  - 10-queens-ha-with-objective.gif
  - 10-queens-ha.gif
  - 10-queens-hill-climbing.gif
  - 10-queens-sa-with-objective.gif
  - 10-queens-sa.gif
  - 10-queens.gif
  - 100-queens-ga.gif
  - 25-puzzle.gif
  - 30-queens-ga-with-objective.gif
  - 30-queens-ga.gif
  - 50-tsp-sa.gif
  - Best_First.png
  - BFS.png
  - DFS_Example.png
  - DLS_IDS.png
  - eight_puzzle_start_goal_actions.png
  - Four-Queens-Local-Search.png
  - GA_cycle.png
  - genetic_algorithm.png
  - Graph-Search_Algorithm.png
  - Graph_Search_Algorithm.png
  - hill_climbing.png
  - local_search.py
  - Romania.png
  - sample_solution_path.png
  - sample_state.png
  - simulated_annealing.png
  - TSP-Ir.png
  - vaccum_world.png
- 01-Search_Problem_Formulation_NPuzzle.ipynb
- 02-Data_Structures.ipynb
- 03-Uninformed_Search_Strategies.ipynb
- 04-Informed_Search_Strategies.ipynb
- 05-Search_Strategies_OOP.ipynb
- 06-Local_Search_NQueens.ipynb
- 07-Local_Search_HillClimbing.ipynb
- 08-Local_Search_SimulatedAnnealing.ipynb
- 09-Local_Search_Genetic_Algorithm.ipynb
- 10-Local_Search_TSP.ipynb
- local_search.py
- npuzzle.py
- nqueens.py
- readme.md
- tsp_utils.py
- utils.py
.gitignore
Introduction.ipynb
README.md
requirements.txt

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# AI-Programming-using-Python
This repository contains implementation of different AI algorithms, based on the amazing AI book [Artificial Intelligence: A Modern Approach](http://aima.cs.berkeley.edu) (4th edition, 2020).
## Contents

### First part:
- Search problems
    - Uninformed search strategies:
        - BFS, DFS, UCS, DLS, IDS
    - Informed search strategies:
        - Gready, A-star

<p align="center">
  <img width="85%" src="Search/imgs/sample_solution_path.png">
  <br>Example: solving 8-puzzle using search algorithms.
</p>

- Local search:
        - Hill climbing, Simulated Annealing, Genetic algorithms

<p align="center">
  <img width="50%" src="Search/imgs/50-tsp-sa.gif">
  <br>Example solution found by simulated annealing for TSP problem (for 50 cities).
</p>

<p align="center">
  <img width="100%" src="Search/imgs/10-queens.gif">
  <br>Example: solving 10-Queens using simulated annealing.
</p>

- Adversarial search and games
        - MiniMax, alpha-beta pruning

#### Python programming concepts
- Object oriented programming in Python
    - Using and defining special python methods (dunder methods).
    - Immutable objects.
    - Making an object hashable (implementing `__hash__()` and `__eq__()` methods.
    - Implementing decortors in Python.
    - Class methods and static methods.
    - `__repr__()` and `__str__()` methods.

### Second part:
- Machine learning
    - Supervised learning:
        - KNN, Naive Bayes, Desision Trees, SVM, Neural Nets
    - Unsupervised learning:
        - k-Means clustering
    - Reinforcement learning
        - Q-learning

### Example problems
- Search:
    - N-Puzzle, N-Queens, TSP
- Games:
    - Pacman, Chess
- Learning:
    - Pacman, Chess, etc.

### Lesson 1: Uninformed (blind) search strategies
- Implementing data structures like stack, queue and priority queue
- Implementing N-Puzzle (8-Puzzle)
- Implementing uninformed search strategies: BFS, DFS, UCS, DLS, IDS
- Programming assignment

### Lesson 2: Informed search strategies
- Implementing informed search strategies: Greedy, A-star
- Programming assignment

### Lesson 3: Local search
- Implementing N-Queens and TSP(a graphical implementation)
- Implementing local search strategies: hill climbing, simulated annealing and genetic algorithms
- Programming assignment

### Lesson 4: Adversarial search and games
- Implementing Otello
- Implementing adversarial search algoritms: Minimax and alpha-beta prunning
- Programming assignment

## Prerequisite
- Basic knowledge of programming (Python)
- Basic knowledge of data structures and algorithms

## After first part:
- You will have a good understanding of basic AI techniques (solving problems using searching)
- You will become a real python programmer and most importantly a real programmer!
- You will see a lot of programming challenges and you will learn how to solve them

## Reference