Sly 2:Game state: Difference between revisions

The '''DAG''' ('''D'''irected '''A'''cyclic '''G'''raph) is a data structure used in Sly 2 and Sly 3 to controlmanage the current state of the game world. It was the subject of a 2005 GDC presentation by Bruce Oberg, the Principal Engineer at Sucker Punch.<ref>[https://www.gdcvault.com/play/1020295/The-Picture-Worth-a-Thousand The Picture Worth a Thousand Bugs] - YouTube, 3 April 2021 (archived from a 2005 GDC conference)</ref>

The DAG is a directed graph of nodes, where each node is called a "''task"''. For instance, <codett>t1_follow_dmitri_on_streets</codett> is the task of tailing Dimitri in the "Follow Dimitri" job (the prefix <codett>t1</codett> indicates that it is a task in Episode 1, and <codett>follow</codett> is the codename for the "Follow Dimitri" job).

At all times, every task ''before'' an Available task must be Complete or Final. Additionally, every task ''after'' an Available task must be unavailable. It is possible to "''force"'' a task to a particular state, which propagates throughout the DAG to ensure those conditions are always met.

Tasks in the DAG can be grouped into ''missions''. A mission usually refers to a particular job in the game's story. For instance, <codett>m1_follow</codett>{{check}} is the job "Follow Dmitri" (the prefix <codett>m1</codett> indicates that it is a mission in Episode 1, and <tt>follow</tt> is the codename for the mission).

If a task belongs to a mission and the "''exit" task'' in that mission is Completed, then all the tasks in that job become Final.