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

Part2: Minimax Search #7

Open
rayfantasy opened this issue Oct 3, 2015 · 0 comments
Open

Part2: Minimax Search #7

rayfantasy opened this issue Oct 3, 2015 · 0 comments

Comments

@rayfantasy
Copy link
Collaborator

Operate minimax search to decide next step

(Could be somehow like this)
Int Minimax(depth, turn) {
/*
*Recursively go through every possible results
*Decide which Point to go for each step
*
*/
check if end, if yes, return checkvalue;
else if depth==depth+3, return check value
get available states;
for (Point: Available states){
Move(Availabe states.get,turn)
Value=minimax(next children states, others turn)
max value
min value
}
if turn==1, return max
if turn==2, return min
}

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