Treasure Hunter!

Status: Alpha

Brought to you by: chazdinkle

Downloads: 0 This Week

Last Update: 2014-07-16

Android

Treasure Hunter! is a game I'm working on for the android platform. It's my first major application, as well as my first android app.

GNU General Public License version 2.0 (GPLv2)

Other Useful Business Software

Add Two Lines of Code. Get Full APM.

AppSignal installs in minutes and auto-configures dashboards, alerts, and error tracking.

Works out of the box for Rails, Django, Express, Phoenix, and more. Monitoring exceptions and performance in no time.

Start Free

Rate This Project

User Reviews

Be the first to post a review of Treasure Hunter!!

Developers

Handheld/Mobile/PDA

Java Puzzle Games, Java Mobile Software

2011-03-03

Go From AI Idea to AI App Fast

One platform to build, fine-tune, and deploy ML models. No MLOps team required.

Access Gemini 3 and 200+ models. Build chatbots, agents, or custom models with built-in monitoring and scaling.

Try Free

Recommended Projects

Hunter
A single player 3D game based on Ogre3D. Theme will be an ancient fantasy land where player is a hunter in the wild. Current version is a simple bow and arrow wolf hunt in first person perspective. Go to http://hunter.sf.net for more info!
Hamster Hunter
Public description: Hamster Hunter is a game which is a little bit similar to Moorhuhn (a famous German freeware game in which you have to kill moorland chickens). But Hamster Hunter has more Maps, Weapons and a completly different ranking system.
S.C.O.U.R.G.E.: Heroes of Lesser Renown
S.C.O.U.R.G.E. is a roguelike game with a 3D user interface. The game allows a group of four characters to search for treasure, kill enemies, gain levels, etc. The code is C++ using SDL, OpenGL and freetype. The game uses Squirrel for scripting.
python-for-android
Turn your Python application into an Android APK
Mobile Sudoku Solver
Mobile Sudoku Solver is a Java (J2ME) application for solving, designing and playing Sudoku puzzle game on mobile devices. It can find all the solutions available and hold them all in memory. You can select one of them, edit and solve it again.