{"repo":"pazusoba/core","free":true,"listed":false,"github":"https://github.com/pazusoba/core","clone":"git clone https://github.com/pazusoba/core.git","description":"Try to solve Puzzle & Dragons with C++","language":"C++","stars":19,"topics":["cpp","python","beam-search","opencv","pyautogui","puzzle-and-dragons","automation"],"license":"MIT","category":"workflow-automation","readme_excerpt":"🍜 パズそば・スーパー Puzzle & Dragons is a mobile game developed by GungHo Online Entertainment,Inc. In this game, there is a board and you can erase orbs to make combos and damage dungeon monsters. Every combo will increase your attack by 25%. Also, there are skyfall orbs that might potentially make more combos. Some demo on YouTube mostly in Japanese. Projects - pazusoba, the core algorithm - pazulove, machine learning - pazuauto, automation - pazuflata, pazusoba with Flutter - pazusoba-android, pazusoba and automation on Android The goal There are 30 \\ 3 ^ 25 possible states for a 6 x 5 board (with max steps of 25) so it is impossible to find the true optimal path. Therefore, the goal is to find a good path quickly. Ideally, it should be short, cascading and aiming for the max combo (except that it is never that ideal). Show more information My approach A priority queue is used which limits the size to a fixed number and only states with a better score can be inserted to the queue. Thus, this is a very greedy approach and it is callled BEAM SEARCH . Overall, it has surpassed many pro players but it is not perfect. I will keep making it better over times. Show more Why beam search Greedy DFS - Greedy B(best)FS - My special greedy BFS - Beam Search As you can see, they are all greedy algorithms based on a heuristic. The reason is that the end goal is unknown and there are also negative values. Simply choosing the local maxima may result in poor solutions. Best first search improves ","default_branch":null,"files":null,"tree":[],"storefront":"/r/pazusoba","claimed":false,"request_supported":{"post":"https://gitbuyer.com/r/pazusoba/core/request-supported","requests":0},"note":"indexed from public GitHub; nothing is for sale on this page. Clone it from GitHub. Paid listings live at /search."}