Skip to content
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

Minimax with alpha-beta prunning #975

Open
michalnowak061 opened this issue Jun 17, 2021 · 0 comments
Open

Minimax with alpha-beta prunning #975

michalnowak061 opened this issue Jun 17, 2021 · 0 comments

Comments

@michalnowak061
Copy link

Brief Intro

Hi there 👋🏻

I would like to add an implementation and an example of using the minimax algorithm. It's an algorithm used in games for example in Tic Tac Toe, and many other games in which we are able to assess the state of the game.

Do you think it will be useful?

More Details

More about algorithm: https://en.wikipedia.org/wiki/Minimax
More about alpha-beta prunning: https://en.wikipedia.org/wiki/Alpha–beta_pruning

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant