Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

thbaylson/Unity-Procedural-Generation

Open more actions menu

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

62 Commits
62 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Procedural Generation Course Project

This repository contains work developed as part of the Unity Procedural Generation: Build Infinite Game Levels course offered by GameDev.tv. The course focuses on creating dynamic 3D dungeon levels using procedural generation techniques in Unity.

Learning Objectives

Throughout this course, I achieved proficiency in the following skills and concepts:

  • Procedural Dungeon Layouts: Developed algorithms that generated unique dungeon layouts comprising interconnected rooms and hallways, creating varied and engaging experiences for each playthrough.

  • NavMesh Generation: Automated the creation of navigation meshes, facilitating efficient pathfinding for AI agents within procedurally generated environments.

  • Dynamic Level Population: Implemented methods for dynamically populating game levels with enemies and obstacles, significantly enhancing gameplay depth and challenge.

  • Advanced C# Programming: Strengthened my C# programming skills by applying advanced concepts and adhering to best practices specifically tailored for procedural content generation.

  • Optimization Techniques: Learned and applied optimization strategies for procedurally generated levels, ensuring high performance and smooth gameplay.

About

Coursework for "Unity Procedural Generation: Build Infinite Game Levels" by Barbara Reichart.

Topics

Resources

Stars

Watchers

Forks

Contributors

Morty Proxy This is a proxified and sanitized view of the page, visit original site.