Found this to be an interesting challenge.
It's just a basic version and it might contain bugs, but it mostly works as intended.
The actual challenge was the win-detection algorithm.
Here is the download to the .capx.
It is by no means perfect, there are many ways to make the win-detection algorithms faster and more effective.
Two things that I thought of:
- The Array search area can be reduced to a 5x5 square with the last inserted coin as the center.
There is no possible case where you insert a coin and win with a combination that is outside this area.
- The check for vertical combinations should not check above the last placed coin since you can't place new coins under already placed ones.
These features are easily implementable, but I didn't have the time to put them in.
Hope this helps.