• Publisher: Namco
  • Release Date: Sep 20, 2005
The Berenstain Bears and the Spooky Old Tree Image
Metascore
tbd

No score yet - based on 0 Critics

User Score
tbd

No user score yet- Awaiting 3 more ratings

Summary: The Berenstain Bears series of books and TV specials has been delighting youngsters around the world for over 4 decades. Now, with the blessing of creators Stan and Jan Berenstain, Brother Bear, Sister Bear and cousin Fred make the leap to interactive entertainment for a new generation of children to enjoy. The Berenstain Bears and the Spooky Old Tree is the most crocodile, spider and bat-infested game in the history of spooky! When the Bears are caught in a thunderous storm and lose their way, they take shelter in a looming, crooked old oak tree in the heart of a dark wood. This giant oak turns out to be The Spooky Old Tree, and without a moment's rest, the Bears must work together to confront the many frightful beasts dwelling within.
Rating: E
Developer: Program-Ace
Genre(s): Platformers
Number of Players:1 Player
License:Other
Cast Credit
Glen A. Cureton QA And Customer Support Manager
Daryle Tumacder QA Supervisor
Gene Bang QA Lead
Mika Kelly Senior PR Manager
Benjamin Cole Producer
Jake Kaufman Music Composer
Jennifer Tersigni Senior Operations Manager
Irina Strilnikova Manager
Oleg Naugolnay Manager
Anton Migulko Art Director
Alexander Kalentiev Programmer
Sergey Bespaly Programmer
Dmitry Bubnov Programmer
Stanislav Karpinsky Programmer
Anatoly Ribas Programmer
Vitaliy Ivanov Programmer
Kostantin Teslenko Game Designer
Vyacheslav Vinogradov Game Designer
Sergey Vinogradov Artist
Viktoria Kriganovskaya Artist
Marina Nikitenko Artist
Andrey Chumachenko Artist
Ruslan Tarasov Pixel Artist
Svetlana Uzkih Pixel Artist
Aleksey Medyanik Designer
Sergey Smal' Designer
Sergey Tron 3d Modeller
Andrey Zhelem Animator
Evheny Mischenko Animator
Alexander Bessarabov Animator
Paul Bragiel Music Producer
Designer/Producer/Programmer credits provided by GameFAQs.
If you contributed to this game and feel you should be credited, please read our FAQ.