ShayanHashemi's repositories
Pacman-uninformed-and-informed-search
In this project, your Pacman agent will find paths through his maze world, both to reach a particular location and to collect food efficiently. You will build general search algorithms and apply them to Pacman scenarios.
000
000
pet-home
a website for pet's foods and accessories ...
Language:JavaScript000
ex-hanoi
ex hanoi base code.
000
LightCity
Babol Noshirvani University of Technology - Advance Programming/ Final Project
000
MIT000
Language:Java000
Language:Java000
Language:Java000
Language:Java000
Language:HTML000
Language:Python000
Language:Python000
000
Language:Python000
Language:Python000
Language:Python000
tic-tac-toe-using-alpha-beta-pruning
Alpha-beta pruning is a modified version of the minimax algorithm. It is an optimization technique for the minimax algorithm. As we have seen in the minimax search algorithm that the number of game states it has to examine are exponential in depth of the tree. Since we cannot eliminate the exponent, but we can cut it to half.
000