🌐 Отображается исходный язык Эта статья еще не переведена на русский язык. Вы просматриваете оригинальную версию. Game Обзор & History The Elven kingdom is in great danger! Thanks to the greed of Elven Queen Ginevra the Elven life-giving shrine was corrupted by the Evil Necromancer. The Troll and his fellow Gremlins must find the remaining […]
Эта статья еще не переведена на русский язык. Вы просматриваете оригинальную версию.
Game Обзор & History
The Elven kingdom is in great danger! Thanks to the greed of Elven Queen Ginevra the Elven life-giving shrine was corrupted by the Evil Necromancer. The Troll and his fellow Gremlins must find the remaining holy shrines scattered around the kingdom to heal the cursed one and banish the Necromancer. Head on to mysterious journey with your creatures and save the Elven kingdom!”This is just as whimsical as the first installment of this game” – SilverBranch (BFG)”Adorable and challenging” – rosekaufmann (BFG)Key Features:Over 40 challenging levelsCustomize and outfit your little helpersEnglish voiceover with funny dialogsSteam achievements , leaderboards and trading cardsChallenging time-management gameplay
02
MEDIA
Галерея
03
PC SPEC
System requirements
Minimum
Minimum:
OS: Win XP
Memory: 256 MB RAM
DirectX: Version 9.0
Storage: 512 MB available space
Recommended
Recommended:
OS: Windows 7
Memory: 512 MB RAM
DirectX: Version 9.0
Storage: 512 MB available space
Copyright in the content and news published on this platform is not reserved, and the material may be shared with attribution. Much of the news is compiled from publicly available domestic and international press sources. Responsibility for the accuracy of claims, data, and material attributed to those sources rests with the source organizations; the platform does not assume responsibility for them. Third-party images, logos, and openly licensed materials remain subject to their original source and license terms.
To submit original news, articles, press releases, or content notices for publication, please contact us:
Присоединяйтесь к обсуждению