Welcome, Guest. Please login or register.

Login with username, password and session length

 
Advanced search

1411423 Posts in 69363 Topics- by 58416 Members - Latest Member: JamesAGreen

April 18, 2024, 09:24:37 PM

Need hosting? Check out Digital Ocean
(more details in this thread)
TIGSource ForumsDeveloperTechnical (Moderator: ThemsAllTook)Many faces of Procedural Generation: Determinism (classification system, part 3)
Pages: [1]
Print
Author Topic: Many faces of Procedural Generation: Determinism (classification system, part 3)  (Read 675 times)
Francisco RA
Level 0
*



View Profile WWW
« on: May 11, 2016, 08:19:58 AM »


Welcome to the third part of this Procedural Generation (aka ProcGen) classification series called “Many faces of Procedural Generation”. To see the previous part click here.

In this post we’ll talk about a classification system on the possible deterministic aspects of ProcGen, which makes sense especially for run-time generation (load and real-time). Procedural does not mean random. Even if you use some kind of (pseudo) random function, if you use the same input seed, you’ll get the same results. Here is how you can classify it:

  • Deterministic generation: When, given the same inputs, you can get the same output. If you are dealing with a large amount of generations, you may need to do some testing to ensure that you do not get any unexpected results or get an outcome that doesn't interfere with the game's objectives.  A good example of deterministic generation is the Universe of the much expected No Man’s Sky, where it’s always the same Universe being generated for everyone (with 18,446,744,073,709,551,616 (18 quintillion) planets, that’s a lot of testing). Another is the 96kb 3D game .kkrieger in the generation of all its content.


  • Deterministic at load-time generation: When you get a deterministic generation only after you’ve loaded the game level. Basically, once you get the initial random inputs the generation becomes deterministic. A few examples of this are the worlds in Minecraft and the level layouts for Rogue-like games such as The Binding of Isaac.


  • Non-Deterministic generation: When you cannot determine the outcome of the generation. Even if you can vaguely predict the outcome generation (because of probability functions), with Non-deterministics you never know for sure. Stateless. An example of this are the obstacles of infinite-runners such as Temple Run.



Hope you guys enjoyed this part of the classification system and check out the previous parts if interested. Let me know if you have any comments or other considerations that I missed Smiley

ANNOUNCEMENT: The project Sceelix - 3D ProcGen Engine - that I’ve been working on with some friends for the last year has finally come out! Yay! Check it out at www.sceelix.com. Trial version now available Smiley

---
Subscribe to this blog here: eepurl.com/bSgft9
Join and Invite others to the slack on ProcGen! procgen.slack.com sign up: bit.ly/procgenregistration
Join and invite others to the facebook group on ProcGen! bit.ly/procgenfb
My twitter account: twitter.com/grillher
Logged
Pages: [1]
Print
Jump to:  

Theme orange-lt created by panic