projects:g9:start
Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
projects:g9:start [2015/02/02 01:23] – cse13141 | projects:g9:start [2015/04/10 18:27] (current) – cse13141 | ||
---|---|---|---|
Line 2: | Line 2: | ||
{{: | {{: | ||
- | |||
- | (TENTATIVE LOGO) | ||
Dungeon of Naleenis (DoN) is a 3D Action Role-Playing Game (ARPG) that combines elements from | Dungeon of Naleenis (DoN) is a 3D Action Role-Playing Game (ARPG) that combines elements from | ||
several similar game genres, which aims to create a unique and fun experience. The majority of the game | several similar game genres, which aims to create a unique and fun experience. The majority of the game | ||
is in a dungeon crawler scenario, where the player must navigate through procedurally generated levels. | is in a dungeon crawler scenario, where the player must navigate through procedurally generated levels. | ||
- | Cooperative play will be encouraged as players will be able to play in groups of up to 4 players, where their | + | Cooperative play will be encouraged as players will be able to play in groups of up to 6 players, where their |
teamwork will be an important factor to their success. | teamwork will be an important factor to their success. | ||
**Prof. Ebrahim Ghafar-Zadeh & Prof. Mark-David Hosale**, Course Directors | **Prof. Ebrahim Ghafar-Zadeh & Prof. Mark-David Hosale**, Course Directors | ||
+ | |||
+ | https:// | ||
=====Developer===== | =====Developer===== | ||
Line 20: | Line 20: | ||
- | |||
- | =====Narrative===== | ||
- | //TODO// | ||
=====Design and Mechanics===== | =====Design and Mechanics===== | ||
Line 131: | Line 128: | ||
====Skills==== | ====Skills==== | ||
- | //TODO// | ||
Line 158: | Line 154: | ||
There are a two main disadvantages of this simplistic algorithm: there will never be loops in the paths, and the main path will always generate away from the starting point. I believe these two shortcomings are not critical, and is worth avoiding the amount of work that would be required to implement a more advanced algorithm. | There are a two main disadvantages of this simplistic algorithm: there will never be loops in the paths, and the main path will always generate away from the starting point. I believe these two shortcomings are not critical, and is worth avoiding the amount of work that would be required to implement a more advanced algorithm. | ||
- | //TODO screenshots// | + | {{: |
- | + | {{: | |
- | ====AI==== | + | {{: |
- | //TODO// | + | |
- | + | ||
- | =====Art===== | + | |
- | //TODO// | + | |
- | + | ||
- | {{: | + | |
- | {{: | + | |
- | {{: | + | |
=====Timeline===== | =====Timeline===== |
projects/g9/start.txt · Last modified: 2015/04/10 18:27 by cse13141