Thanks to visit codestin.com
Credit goes to github.com

Skip to content

Fixed alphabeta_search #123

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

Merged
merged 2 commits into from
Mar 11, 2016
Merged

Fixed alphabeta_search #123

merged 2 commits into from
Mar 11, 2016

Conversation

Chipe1
Copy link
Contributor

@Chipe1 Chipe1 commented Mar 11, 2016

Tried to make it as close to the book as possible. Please comment if there is a better solution to find the action which gives the best outcome. Some solutions are:

  1. Make MAX-VALUE and MIN-VALUE return even the action which lead to the value [ Different from the book ]
  2. Recompute MIN-VALUE for each resultant state and compare with MAX-VALUE [ Beats the point of pruning in the first step if answer is far in the list of actions ]

@norvig
Copy link
Collaborator

norvig commented Mar 11, 2016

This is good. Another way to do it is with @memoize decorator; I think your way is good for 3rd edition code; let's wait and see what 4th edition looks like to see if we need to alter this.

norvig added a commit that referenced this pull request Mar 11, 2016
@norvig norvig merged commit 8b1b8a6 into aimacode:master Mar 11, 2016
@Chipe1 Chipe1 deleted the alphabeta branch March 11, 2016 23:50
@Chipe1
Copy link
Contributor Author

Chipe1 commented Mar 11, 2016

@norvig Hope that end issue #34

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

Successfully merging this pull request may close these issues.

2 participants