Custom cover image
Custom cover image

Mazes for programmers : code your own twisty little passages / Jamis Buck ; [edited by Jacquelyn Carter]

By: Contributor(s): Resource type: Ressourcentyp: BuchBookLanguage: English Series: The pragmatic programmersPublisher: Dallas, Texas ; Raleigh, North Carolina : The Pragmatic Bookshelf, July 2015Description: xiv, 266 Seiten : Illustrationen, DiagrammeISBN:
  • 9781680500554
Subject(s): DDC classification:
  • 005.1/1 23
  • 005.11
RVK: RVK: ST 230 | ST 134 | SU 500LOC classification:
  • QA76.6
Summary: Part I. The basics : Your first random mazes : Preparing the grid ; The binary tree algorithm ; The sidewinder algorithm -- Automating and displaying your mazes : Introducing our basic grid ; Displaying a maze on a terminal ; Implementing the binary tree algorithm ; Rendering a maze as an image -- Finding solutions : Dijkstra's algorithm ; Implementing Dijkstra's ; Finding the shortest path ; Making challenging mazes ; Coloring your mazes -- Avoiding bias with random walks : Understanding biases ; The Aldous-Broder algorithm ; Implementing Aldous-Broder ; Wilson's algorithm ; Implementing Wilson's algorithm -- Adding constraints to random walks : The hunt-and-kill algorithm ; Implementing hunt-and-kill ; Counting dead ends ; The recursive backtracker algorithm ; Implementing the recursive backtracker -- Part II. New steps : Fitting mazes to shapes : Introducing masking ; Implementing a mask ; ASCII masks ; Image masks -- Going in circles : Understanding polar grids ; Drawing polar grids ; Adaptively subdividing the grid ; Implementing a polar grid -- Exploring other grids : Implementing a hex grid ; Displaying a hex grid ; Making hexagon (sigma) mazes ; Implementing a triangle grid ; Displaying a triangle grid ; Making triangle (delta) mazes -- Braiding and weaving your mazes : Braiding mazes ; Cost versus distance ; Implementing a cost-aware Dikstra's algorithm ; Introducing weaves and insets ; Generating weave mazes -- Part III. More algorithms : Improving your weaving : Kruskal's algorithm ; Implementing randomized Kruskal's algorithm ; Better weaving with Kruskal ; Implementing better weaving -- Growing with Prim's : Introducing Prim's algorithm ; Simplified Prim's algorithm ; True Prim's algorithm ; The growing tree algorithm -- Combining, dividing : Eller's algorithm ; Implementing Eller's algorithm ; Recursive division ; Implementing recursive division -- Part IV. Extending mazes into hight dimensions : Understanding dimensions ; Introducing 3D mazes ; Adding a third dimension ; Displaying a 3D maze ; Representing four dimensions -- Bending and folding your mazes ; Cylinder mazes ; Möbius mazes ; Cube mazes ; Sphere mazes -- Summary of maze algorithms : Aldous-Broder ; Binary tree ; Eller's ; Growing tree ; Hunt-and-kill ; Kruskal's (randomized) ; Prim's (simplified) ; Prim's (true) ; Recursive backtracker ; Recursive division ; Sidewinder ; Wilson's -- Comparison of maze algorithms : Dead ends ; Longest path ; Twistiness ; Directness ; IntersectionsCall number: Grundsignatur: 2016 A 2364PPN: PPN: 834994798
Holdings
Item type Home library Collection Shelving location Call number Status Barcode
Freihandbestand ausleihbar Bibliothek Campus Süd inf 3.25 Lesesaal Wirtschaftswissenschaften und Informatik (LSW) 2016 A 2364 Available 51866229090
Total holds: 0
KIT – The University in the Helmholtz Association                         Home | Impressum | Datenschutz | Barrierefreiheit | KIT