Snack Attack
- This article is about the video game. For the Jr. FLL game, see Snack Attack (FIRST).
| Snack Attack | |
|---|---|
|
A screenshot from Snack Attack. | |
| Developer(s) | Funtastic[1] |
| Publisher(s) | Datamost[1] |
| Designer(s) | Dan Illowsky[2] |
| Platform(s) | Apple II |
| Release date(s) | |
| Genre(s) | Maze |
| Mode(s) | Single-player |
Snack Attack is a 1982 for the Apple II family of computers, created by Dan Illowsky and published by Datamost. The gameplay mechanics are very similar to those of Pac-Man, which was released two years earlier. The sequel, Snack Attack II, is a PC-only game co-authored with Michael Abrash and published by Funtastic.[2]
Gameplay
The player controls the Snacker, a small, white, fish-like character, moving through a maze in order to eat all the gumdrops scattered throughout. Meanwhile, the Gumdrop Guards, four enemies that resemble the ghosts in Pac-Man, patrol the maze in an attempt to catch the Snacker. Green and purple barriers can only be crossed by the Snacker and the Guards, respectively.
By eating one of several magic stars in the maze, the Snacker gains a set of sharp teeth and can briefly eat the guards for bonus points, sending them back to their home base to regenerate. At times, a giant smiling pumpkin appears and can be eaten for bonus points. Once all the gumdrops and stars have been cleared, the player begins the next maze at a faster speed. The game cycles through three different mazes.
Reception
Snack Attack was well received, and was granted an award in the category of "Best Solitaire Computer Game" at the 4th annual Arkie Awards where judges praised its "multiple mazes, charming graphics and sound effects, and well-night-addictive play action". The game's color-coded doors were also described as "another big plus, adding a dollop of strategy".[3]:33
References
- 1 2 3 Snack Attack at GameFAQs
- 1 2 "The Giant List of Classic Game Programmers".
- ↑ Kunkel, Bill; Katz, Arnie (March 1983). "Arcade Alley: The Best Computer Games". Video (Reese Communications) 6 (12): 32–33. ISSN 0147-8907.