https://github.com/mercury13/mystic-pillars-solver

Solver for “Mystic Pillars” smartphone game (Kannada)
https://github.com/mercury13/mystic-pillars-solver

game-solver mystic-pillars puzzle-solver

Last synced: about 1 year ago
JSON representation

Solver for “Mystic Pillars” smartphone game (Kannada)

• Host: GitHub
• URL: https://github.com/mercury13/mystic-pillars-solver
• Owner: Mercury13
• License: mit
• Created: 2022-08-09T14:45:49.000Z (almost 4 years ago)
• Default Branch: main
• Last Pushed: 2022-08-09T15:51:43.000Z (almost 4 years ago)
• Last Synced: 2025-01-26T17:47:36.492Z (over 1 year ago)
• Topics: game-solver, mystic-pillars, puzzle-solver
• Language: C++
• Homepage:
• Size: 12.7 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: readme.md
  • License: LICENSE

Awesome Lists containing this project

README

          
# What’s this?

Solver for [Mystic Pillars](https://play.google.com/store/apps/details?id=com.HolyCow.MysticPillars), an Indian (Kannada) smartphone game.

Pillars are connected with links; some are unidirectional, some are bidirectional. Some pillars have gems on them. The move is: if the shortest path between pillars A and B is 4, then you take 4 gems from pillar A and put them to pillar B. You must convert the pillars to predetermined final state in N moves.

I stuck in level 95 and decided to write a solver.

Right now you program levels just in source code.