-
Notifications
You must be signed in to change notification settings - Fork 16
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Implement MinMax Algorithm for Game AI in EDUX #149
Comments
Hello, my name is Trifon and i am studying on Computer Science Department of Aristotle University of Thessaloniki and i would like try to implement this feature for making my first contribution in open source code! |
Hi, nice to hear that. Please join our Discord server; we chat about development-related stuff there: https://discord.gg/wPu6ngXY Dev Guidelines |
hello. how is this going? |
Description
The MinMax algorithm is a pivotal decision-making tool in game AI development, enabling AI to choose optimal moves based on a minimax strategy. This algorithm is particularly useful in two-player games like chess or tic-tac-toe. Despite EDUX's versatility in machine learning, it currently lacks direct support for this algorithm. Implementing MinMax in EDUX will expand its applicability to game development and AI simulations, providing a valuable tool for developers in these fields.
Proposed Feature
Benefits
Conclusion
Integrating the MinMax algorithm into EDUX will significantly enhance its capabilities in game AI development, making it a more comprehensive machine learning library. This feature will not only cater to game developers but also to educators and researchers in AI.
The text was updated successfully, but these errors were encountered: