Some error occured while loading the Quick View. Please close the Quick View and try reloading the page.
This book lends insight into solving some well-known AI problems using the most efficient problem-solving methods by humans and computers. The book discusses the importance of developing critical-thinking methods and skills, and develops a consistent approach toward each problem. This book assembles in one place a set of interesting and challenging AI–type problems that students regularly encounter in computer science, mathematics, and AI courses. These problems are not new, and students from all backgrounds can benefit from the kind of deductive thinking that goes into solving them. The book is especially useful as a companion to any course in computer science or mathematics where there are interesting problems to solve.
Features:
•Addresses AI and problem-solving from different perspectives
•Covers classic AI problems such as Sudoku, Map Coloring, Twelve Coins, Red Donkey, Cryptarithms, Monte Carlo Methods, Rubik’s Cube, Missionaries/Cannibals, Knight’s Tour, Monty Hall, and more
•Includes a companion disc with source code, solutions, figures, and more
•Offers playability sites where students can exercise the process of developing their solutions
•Describes problem-solving methods that might be applied to a variety of situations
eBook Customers: Companion files are available for downloading with order number/proof of purchase by writing to the publisher at info@merclearning.com.
Kopec Danny :
Danny Kopec (Late) taught at Brooklyn College. He authored several books and journal articles and was an International Chess Master.
Pileggi Christopher :
Christopher Pileggi holds a degree in Computer Information Science and is employed by the Center for Economic Workforce & Development.
Ungar David :
David Ungar holds a degree in Computer Information Science.
Shetty Shweta :
Shweta Shetty is an SAP PI Consultant.
2: Problem Solving.
3: The Missionaries and Cannibals Problem.
4: The 12 Coins Problem.
5: Cryptarithms.
6: The Red Donkey Puzzle.
7: The 15 Puzzle.
8: The Knight’s Tour Problem.
9: Mastermind.
10: The Monty Hall Problem.
11: Rubik’s Cube.
12: The Prisoner’s Dilemma.
13: Sudoku.
14: Map Coloring and the Chromatic Number.
15: Cryptography.
16: Random Walks on Graphs & Monte Carlo Methods.
17: Miscellaneous Problems.
On the Companion Disc:
Appendix A—Student Solutions.
Appendix B—12 Coins Algorithm.
Appendix C—Human Window Study.
Appendix D—Program Solutions to Problems.
Index.