Skip to content

dana-akesh/Optimal-Strategy-for-a-Game-using-Dynamic-Programming

Repository files navigation

Optimal-Strategy-for-a-Game-using-Dynamic-Programming

Are you looking to improve your game and dominate the competition? Dynamic programming can help! It is an algorithm to solve complex optimization problems by breaking them down into smaller subproblems and solving each subproblem only once.

By analyzing all possible moves and outcomes, dynamic programming takes into account the current state of the game and your opponent's potential future moves. This helps you find the best possible strategy and gives you a competitive edge that your opponent won't be able to match.

Please watch the video below to see the app's features and functionality. Your feedback on the user interface design, performance, and potential improvements would be greatly appreciated. Thank you!

Coin_Game_2023-04-30_23-48-23_AdobeExpress.mp4

About

An application coin game of the dynamic algorithms, the winner has the most coins with high values

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages