While many think of algorithms as specific to computer science, at its core algorithmic thinking is defined by the use of analytical logic to solve problems. This logic extends far beyond the realm of computer science and into the wide and entertaining world of puzzles. In Algorithmic Puzzles, Anany and Maria Levitin use many classic brainteasers as well as newer examples from job interviews with major corporations to show readers how to apply analytical thinking to solve puzzles requiring well-defined procedures. The book's unique collection of puzzles is supplemented with carefully developed tutorials on algorithm design strategies and analysis techniques intended to walk the reader step-by-step through the various approaches to algorithmic problem solving. Mastery of these strategies--exhaustive search, backtracking, and divide-and-conquer, among others--will aid the reader in solving not only the puzzles contained in this book, but also others encountered in interviews, puzzle collections, and throughout everyday life. Each of the 150 puzzles contains hints and solutions, along with commentary on the puzzle's origins and solution methods. The only book of its kind, Algorithmic Puzzles houses puzzles for all skill levels. Readers with only middle school mathematics will develop their algorithmic problem-solving skills through puzzles at the elementary level, while seasoned puzzle solvers will enjoy the challenge of thinking through more difficult puzzles.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
adjacent algorithm design strategies binary bit string book’s checkers chessboard color column Comments The puzzle Comments The solution configuration consecutive consider counters Counting Design an algorithm diagonal Digit Sum digits disks dominoes Dutch National Flag dynamic programming equal Euler path example Fifteen Puzzle finite number flipped formula given graph greedy Hence horizontal initial instance integer iterations Josephus Problem jump knights leftmost magic square marked cells Martin Gardner mathematical mathematical induction mathematician minimum number missing square n-Queens Problem neighbors number of coins number of moves obtained odd number optimal pairs pancakes parity piles possible puzzle’s question rectangle recursively rooster Sam Loyd shown in Figure Single-Elimination Tournament Solitaire Solution The answer solve the problem solve the puzzle Sorting staircase region starting switch tetrominoes total number tour Tower of Hanoi triangle Tromino Tiling tutorial on algorithm values vertex vertices weights