Automated Maze Solver for Android
Budget / SalaryA$250–750
TypeFreelance project
LocationRemote
Posted2 hours ago
I have an Android mini-game on the Play Store called “Terrmine.” The player guides a miner through ever-changing mazes, but I now want the game to steer itself. Your task is to build and plug in smart logic that recognises each layout, decides the optimal route, and moves the miner to the exit without any manual input—then immediately starts over and does it again.
The solver must cope with every maze the game can generate, not just a handful of preset stages. You are free to choose the most suitable language or framework (Java, Kotlin, C++—whichever lets you deliver the cleanest, fastest result and fits easily into the current Android build).
Occasional voice calls are essential, so comfortable spoken English is a must let’s discuss how you plan to:
• detect the maze reliably on each run,
• compute the path in real time, and
• drive in-game movement without lag or glitches.
Must show me demo of proof of concept
Once you can show the miner finishing every level on its own, I’m ready to sign off and publish an update. Looking forward to hearing how you’d tackle it.
The solver must cope with every maze the game can generate, not just a handful of preset stages. You are free to choose the most suitable language or framework (Java, Kotlin, C++—whichever lets you deliver the cleanest, fastest result and fits easily into the current Android build).
Occasional voice calls are essential, so comfortable spoken English is a must let’s discuss how you plan to:
• detect the maze reliably on each run,
• compute the path in real time, and
• drive in-game movement without lag or glitches.
Must show me demo of proof of concept
Once you can show the miner finishing every level on its own, I’m ready to sign off and publish an update. Looking forward to hearing how you’d tackle it.
Apply on Freelancer →
Project sourced from Freelancer.com. Applications happen directly on the original platform — we never collect your data.