Acceso restringido con credenciales UPSA

“…., a firm hired by the strikers to advance their cause, Hardy Green offers the first insider’s account of this watershed strike. …”

Tabla de Contenidos: “…-- Dijkstra's algorithm -- The A* algorithm -- A breakdown of A* -- Representing a level as nodes -- The open and closed list -- The H, G, and F costs -- The H value -- The G value -- The F value -- The Manhattan distance -- Parenting nodes -- The pseudo-algorithm -- Coding the A* pathfinding algorithm -- The Tile datatype -- Creating supporting functions -- The Level class -- The Enemy class -- Variable declarations -- Precalculating the H values -- Defining the main loop -- Finding the adjacent nodes -- Calculating the G and F costs -- Calculating the G and F cost -- Checking for superior paths -- Creating the final path -- Implementing A* in the game -- Enabling the enemy to follow a path -- Calling the pathfinding behavior -- Viewing our path -- Procedurally generated level goals -- The variable and function declarations -- Generating a random goal -- Checking whether a goal is complete -- Drawing the goal on the screen -- Exercises -- Summary -- Chapter 9: Procedural Dungeon Generation -- The benefits of procedural level design -- Replayability -- A reduction in development time -- Larger game worlds -- Considerations -- A lack of control -- Required computing power -- Suitability -- An overview of dungeon generation overview -- Generating rooms -- Generating a maze -- Connecting rooms and mazes -- The recursive backtracker -- Procedurally generating a dungeon -- Changing how we view the maze -- Updating the Game and Level classes -- Generating a maze -- Preparing before the generation of a maze -- Carving passages -- Adding rooms -- Choosing the tile textures -- The if/else approach -- Bitwise tile maps -- Calculating the tile values -- Mapping the tile value to textures -- Calculating tile textures -- Creating unique floor themes -- Adding entry and exit points -- Setting a player's spawn location…”