Comparison between alpha beta pruning algorithm and greedy algorithm in designing winning strategies in the game of checkers / Christy Jr Tan
Alpha Beta Pruning is an algorithm to prune unnecessary branches. The idea of not exploring the branches if we know that it is worthless makes it a powerful algorithm ever invented. The algorithm is useful in some of the game search available today. Meanwhile, the ability of greedy algorithm to s...
Saved in:
| Main Author: | |
|---|---|
| Format: | Student Project |
| Language: | en |
| Published: |
Faculty of Information Technology and Quantitative Sciences
2007
|
| Online Access: | https://ir.uitm.edu.my/id/eprint/1423/1/PPb_CHRISTY%20JR%20TAN%20CS%2007_5.pdf https://ir.uitm.edu.my/id/eprint/1423/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|