Parkitect

The general premise of the game is to open, build, and successfully maintain an amusement park, similar to the RollerCoaster Tycoon series. The player must build a multitude of attractions, manage the park, and keep their guests happy. The player may hire staff to fulfil the needs of the park. Parkitect introduces several aspects that differentiate from the classic RollerCoaster Tycoon series including staff buildings, resource depots, and hidden staff-only areas. Furthermore, the game introduces a branching map system within its campaign mode. The game supports user-created mods, assets and rides, distributed via Steam Workshop. == Development ==

In March 2014, development started as an attempt to simulate coaster physics before deciding to turn it into a full theme park simulation game. On June 1, 2014, Sebastian Mayer posted a screenshot of the yet-to-be titled game on Reddit. Texel Raptor launched the Kickstarter of the game on August 22, 2014, as Parkitect. By September 2014, the campaign had raised over 63,730. From then on, Texel Raptor released weekly images and stats regarding the development of the game. Texel Raptor released the pre-alpha to those who pre-ordered and backed the game in September 2015. In April 2016, Texel Raptor announced that Parkitect would be released as an early access game on Steam on May 5, 2016. The game fully released out of early access on November 29, 2018. In December 2020, a cooperative multiplayer mode that accommodates up to eight players was released for free. The game's second expansion, Booms & Blooms, was released on September 2, 2020. == Reception ==

The game received "generally positive reviews", according to review aggregator website Metacritic. Two years after Parkitects release on Early Access, Ellen McGrody of PC Gamer noted that the game "has grown from a simple recreation of the isometric rollercoaster sim to an evolution of it". Right before the game's release, Matt Wales of Eurogamer wrote that the game already possessed a "thriving" modding scene. == References ==