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...
Main Author: | Jr Tan, Christy |
---|---|
Format: | Student Project |
Language: | English |
Published: |
Faculty of Information Technology and Quantitative Sciences
2007
|
Online Access: | http://ir.uitm.edu.my/id/eprint/1423/ http://ir.uitm.edu.my/id/eprint/1423/1/PPb_CHRISTY%20JR%20TAN%20CS%2007_5.pdf |
Similar Items
-
Christie's rock & pop memorabilia
by: Doggett
Published: (2003) -
Adapting the Elitism on the Greedy Algorithm for Variable Strength Combinatorial Test Cases Generation
by: Bahomaid, Ameen A., et al.
Published: (2018) -
Checkered flag projects 10 rules for creating and managing projects that win!
by: Randolph
Published: (2002) -
Synthesis and antimicrobial activity of Halobenzoylthiourea Bearing alpha and beta alanine
by: Ngah, Nurziana, et al.
Published: (2013) -
Ortho's all about pruning
by: Lowe
Published: (1999)