Contents
This is a course for students interested in methods of procedural content generation (PCG) in computer games. An overview of PCG methods is presented and a variety of approaches is investigated more thoroughly. The labs focus on the practical usage of PCG in more-or-less developed computer games and use some elementary knowledge of Java/Kotlin and Python (no prior knowledge of the languages required, with willingness you can learn as you go). The course is taught at MFF UK as NAIL123.
News
Follow the appropriate channel at Gamedev Discord!
https://discord.gg/Zts98PGw6z
Dates (SIS)
Lectures will be interwoven with Labs on even / odd weeks, but the course starts with two consecutive lectures.
Course Exam
There will be an oral examination done during the examination period, either in-person or online, depending on the situation. The exam will be a mixture of direct question on the topics below and open questions where you will be describing a procedural approach for given content.
Exam topics
Classification of PCG: Reasons for PCG in games. Design-time vs runtime. Teleological vs ontogenetic. Direct vs indirect.
Terrain: Simple approaches for terrain generation. The diamond-square algorithm.
Noise: Value vs. gradient noise. Octaves. Perlin noise. Advantages of simplex noise. Domain warping. Use-cases for analytical derivatives. Billow and ridge noise. Cellular (Worley) noise. 3D approaches. Perlin worms.
Search-based: Pros/cons of various content representations. Building blocks. Template search. Evolutionary algorithms – differences when using for PCG. Types of evaluation functions. Assessing quality of generators.
Methods: Cellular automata. L-systems. Shape and graph grammars.
Visual art: Art toys (what are they, what are they for). Procedural effects.
Musical art: Approaches for music. Melody. Harmonization.
Constraint-based programming: Answer set programming – description, use-cases. AnsProlog. Wave function collapse.
Mixed-initiative approaches: Definition. Three initiatives (of dialogue). Pros/cons.
Mazes: Types. Attributes. Objectives. Solving (computer/human methods). Perfect maze generation (Kruskal’s algorithm, backtracking).
Dungeons: Combining maze algorithms with rooms. Space division methods. Mission graphs + space layout options. Enemy placement. Spawning waves.
Loot: Methods. Affixes. Loot tables. Variability. Player interaction with loot system.
Puzzles: Approaches.
Lectures
Lectures Schedule
| No. | Date | Topic | Lecturer | Content | Slides |
| 0 | 1.3. | Introduction | Vojtěch Černý | What is Procedural Content Generation Reason to use PCG Brief history Interesting implementations Course structure |
PPTX, PDF |
| 1 | 8.3. | Terrain | Vojtěch Černý | Why generate terrain Simple approaches Noise functions 2D and 3D approaches |
PPTX, PDF |
| 2 | 22.3. | Search-based PCG | Vojtěch Černý | Different approach to PCG Content representation Search algorithms Evaluation functions Spelunky & Yavalath Assessing PCG Quality |
PPTX, PDF |
| – | 12.4. | cancelled | |||
| 3 | 19.4. | Procedural Art | Vojtěch Černý | Game vs. Toy Automata & Grammars revisited L-Systems Intro to procedural music |
PPTX, PDF |
| – | 26.4. | cancelled | |||
| 4 | 3.5. | Constraints | Vojtěch Černý | Answer Set Programming Generating game rules Mixed-initiative generation Wave Function Collapse |
PPTX, PDF |
| 5 | 10.5. | Maze & Dungeons | Vojtěch Černý | Maze Generation Dungeon Generation Procedural Puzzles Procedural Loot |
PPTX, PDF |
Labs
The labs will consist of short introductions to specific PCG contexts (usually games) and homeworks.
A total of 5 homeworks worth 18 points total will be presented during the semester. 12 points are required for admittance to the exam, and any above 12 will be transferred to the exam points (Exam has a 50 point maximum and 40 points are needed to pass, so extra points are significant).
For the 1st practical please have your laptop with preinstalled Java (JDK) 17+. Modify PATH and JAVA_HOME environment variables such that it is your default. Also (for your comfort), IntelliJ IDEA is recommended – community edition is sufficient, but as a student you can get ultimate edition for free – basically by just asking for it on their site.
For the 2nd practical, you will need the setup from above, and also Python 3 installed and added to your PATH.
The 5th and 6th practicals will consist of one large homework, worth 6 points. You should submit the first part, receive feedback, incorporate it and extend your work with the second part of the assignment.
Submission details of each HW is outlined in its slides.
Labs Schedule
| No. | Date | Topic | Lecturer | Slides | Prerequisites | Homework | HW pts | Standard Deadline |
| 1 | 15.3. | Minecraft | Vojtěch Černý | PPTX, PDF | Java 21, (recommended) IntelliJ IDEA |
HW1 – Minecraft | 3 | 28.3. 23:59 |
| 2 | 5.4. | Mario | Vojtěch Černý | PPTX, PDF | Java 21, (recommended) IntelliJ IDEA Python 3 |
HW2 – Mario | 3 | 19.4. 23:59 |
| 3 | 19.4. (after lecture) | Music | Vojtěch Černý | PPTX, PDF | Python 3 | HW3 – Music | 3 | 2.5. 23:59 |
| 4 | 3.5. (after lecture) | Murder Mystery | Vojtěch Černý | PPTX, PDF | Python 3, AnsProlog |
HW4 – Murder Mystery | 3 | 17.5. 23:59 |
| 5 | 17.5. | Moguelike | Vojtěch Černý | PPTX, PDF | Java 21, (recommended) IntelliJ IDEA | HW5- Moguelike | 6 | 14.6. 23:59 |
| Author | Album Title | Link |