Dead Ends

1
Dead Ends

• Dan Geil
• Elliot Lynde
• Evan Driscoll

John Byrne Jon Steinich
2
Level Generation
3
Source Wikipedia (maze generation algorithms)
4
Source Wikipedia (maze generation algorithms)
5
Source Wikipedia (maze generation algorithms)
6
Source Wikipedia (maze generation algorithms)
7
Source Wikipedia (maze generation algorithms)
8
(No Transcript)
9
(No Transcript)
10
(No Transcript)
11
(No Transcript)
12
(No Transcript)
13
(No Transcript)
14
(No Transcript)
15
(No Transcript)
16
Level Loading
17
Zombie AI
18
Zombie AI - Movement
Floyd-Warshall All-pairs min cost matrix based
on built node link graph -One node on each side
of a doorway, a certain distance away -All nodes
within a room connected -All doorway nodes
connected.
2 Cases In the same room as the player, and
not. -Not in the same room use min cost matrix
from all nodes in zombie room to all nodes in
player room, taking distance to those nodes into
account. Travel to node of least cost. -In the
same room move to player position directly.
19
Zombie AI- Attacking the Player
-Zombies attack the player when within some
distance d from the player -At the end of the
attack animation, if the player is within a
larger distance a, the attack hits and the player
is damaged. -If a zombie is attacking the player,
and another zombie attempts to move closer to the
player from behind that zombie, he agitates the
attacking zombie, pushing him tangent to the
circle defined by the radius d around the player.
This allows multiple zombies to attack the player
when approaching the player in a line, and acts
to trap the player.
20
Shooting
21
Game State Machine
22
Demo!