Cost-Optimized Expense 8-Puzzel Solver

• Developed a Python-based command-line game, a strategic variation of the classic Nim game, featuring two piles of marbles (red and blue) with standard and misère rules.

• Integrated a MinMax algorithm with Alpha-Beta Pruning to power the computer's moves, ensuring optimal gameplay decisions based on the game's complexity.

• Implemented customizable gameplay where players can select the number of marbles, game version (standard/misère), first player (human/computer), and AI depth for strategic difficulty adjustment.

• Designed a scoring mechanism where each remaining red marble contributes 2 points and each remaining blue marble contributes 3 points, enhancing the competitive experience.

• Programmed distinct move orders for the AI, optimizing its strategy for both standard and misère versions to challenge the human player.

• Built a seamless command-line interface that supports flexible inputs for game configuration, ensuring an engaging and user-friendly experience.

• Implemented depth-limited MinMax search to optimize computational efficiency, allowing the AI to handle varying levels of game complexity without sacrificing performance.