Embedded Files
I was inspired by the ChainReaction Game that went viral on play store
I was continuously thinking on how I can build and implement such a game
At that time I had no idea of Game Development, However I converted the problem into 2D array and then tried to solve the game triggers
0 1 2 3 40 [ ] [ ] [ ] [ ] [ ]1 [ ] [ ] [ ] [ ] [ ]2 [ ] [ ] [ ] [ ] [ ]3 [ ] [ ] [ ] [ ] [ ]4 [ ] [ ] [ ] [ ] [ ] | | | click(1,2) | V 0 1 2 3 40 [ ] [ ] [ ] [ ] [ ]1 [ ] [ ] [1] [ ] [ ]2 [ ] [ ] [ ] [ ] [ ]3 [ ] [ ] [ ] [ ] [ ]4 [ ] [ ] [ ] [ ] [ ] | | | click(1,2) | V 0 1 2 3 40 [ ] [ ] [ ] [ ] [ ]1 [ ] [ ] [2] [ ] [ ]2 [ ] [ ] [ ] [ ] [ ]3 [ ] [ ] [ ] [ ] [ ]4 [ ] [ ] [ ] [ ] [ ] | | | click(1,2) | V 0 1 2 3 40 [ ] [ ] [ ] [ ] [ ]1 [ ] [ ] [3] [ ] [ ]2 [ ] [ ] [ ] [ ] [ ]3 [ ] [ ] [ ] [ ] [ ]4 [ ] [ ] [ ] [ ] [ ] | | | click(1,2) | V 0 1 2 3 40 [ ] [ ] [1] [ ] [ ]1 [ ] [1] [ ] [1] [ ]2 [ ] [ ] [1] [ ] [ ]3 [ ] [ ] [ ] [ ] [ ]4 [ ] [ ] [ ] [ ] [ ]ALRIGHT! This looks amazing that I converted this game problem to a 2D array problem
Now the goal was to solve the complex chain reaction that gets generated on user click choices
My First Approach:
- On Burst, check all the cells from start whether they are in safe state or can burst
- This was a naive / brute force approach with O(n^2) time complexity
My Second Approach:
- On Burst, start a Depth First Search traversal
- Burst only those which come under this traversal path
- This improved my algorithm and also learnt about how DFS can help in such scenarios with time complexity O(n)
You can find the code on github, I have used Python to develop the game using PyGame
Google Sites
Report abuse