Nim is a mathematical combinatorial game in which two players take turns removing, or nimming, objects from distinct heaps or piles Although its rules are simple, which makes it extremely easy to play, it requires a solid strategic reasoning in order to win against experienced players. This study presents an optimised strategic approach to the game of Nim, which represents the guaranteed winning strategy for this game for the first player to take action. The proposed approach is a fundamental combinatorial game rooted in Boolean algebra and the XOR operation. Unlike traditional strategies that solely rely on XOR calculations to determine winning and losing positions, this research identifies and analyses anomalous strategic behaviours that challenge conventional Nim theory, revealing previously unexplored patterns in specific game configurations. To validate these findings, a Python-based application has been developed, implementing the proposed strategy to ensure consistent victory. The algorithm systematically applies XOR calculations, executes optimal moves, and dynamically adapts to anomalies, demonstrating how these irregularities can be leveraged for strategic advantage. This computational validation reinforces the theoretical framework and provides new insights into the limitations and extensions of classical Nim strategies. Beyond its implications for Nim, this research highlights the broader potential of AI-driven decision-making in combinatorial games. By demonstrating how algorithmic intelligence can analyse game states, predict outcomes, and refine strategies, this study contributes to advancements in artificial intelligence, optimisation algorithms, and complex strategic decision-making models.