DeepRead
Cover of Algorithmic puzzles

Algorithmic puzzles

Anany Levitin · 2011

Mathematics and physics › Recreational mathematics

#14,054 most recommended

About the book

A collection of puzzles drawn from recreational mathematics and computer science, including games, board-covering problems, coin and weighing problems, river-crossing and move-sequence puzzles, and combinatorial challenges. Each puzzle is posed as a problem to solve, with hints and solutions, and the material ranges from elementary to more demanding. Puzzles can build algorithmic thinking, the habit of reasoning about how to find a solution systematically rather than by ad hoc trial. The book suggests that many puzzles reward recognizing general strategies such as exhaustive search, reduction of one problem to another, modelling a situation as a graph, using invariants to rule out impossible configurations, and exploiting symmetry or divide-and-conquer. Its central claim is that the same reasoning used in recreational puzzles carries over to designing and analysing real algorithms.

Written by Claude from what it knows of this book.

What Hacker News says 50% recommend · 0% critical

00.512015201620172015 peak · 1
This bookAverage book in Recreational mathematics

In the commenters’ own words

What Open Library readers say

No Open Library reader has rated it yet.

  • 3 want to read
  • 0 reading
  • 0 have read

Open Library’s page for the book

What Wikipedia says

  • published 2011
  • 169 views a month

Read the Wikipedia article

Reddit communities — coming later

The threads it came up in

Details

First published
2011
ISBN
9780199740444
Editions known
6 at Open Library
Open Library
OL16470090W

AlgorithmsMathematical recreations

Explore in the mosaic

Read next: its neighbours on the mosaic