Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Made AI stronger by working on Minimax/AB pruning #2

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
code-geek merged 1 commit into code-geek:master from Suraj1127:master
Sep 25, 2018

Conversation

@Suraj1127
Copy link
Contributor

@Suraj1127 Suraj1127 commented Sep 24, 2018

Made AI stronger by implementing and modifying the following things.

  • Integrated closed spaces(ghost goats) into the evaluation function.
  • Set the minimax initial variable(value) to the different value than the value returned when win condition is reached. It was creating an error of not making any move when no move is found better.

Copy link
Contributor Author

  • Previously, I had omitted movable tigers parameter from evaluation function but AI was defeated when I played with trapping tigers strategy. Then, I integrated it into the evaluation function again.
  • Problem which I thought was created by that movable tiger thing was actually because of the initial value(value) thing. So, again I included and the AI became better.


# find the minimum attainable value for the minimizer
if not is_max:
value = self.INF
Copy link
Owner

@code-geek code-geek Sep 24, 2018

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Why replace INF?

Copy link
Contributor Author

Suraj1127 commented Sep 25, 2018 via email

To make the value variable as small as we can. Previously, it was equal to the value of the win/loss state. Ideally, it should be +/- infinity and the win/loss state should be some finite large number. We have made the win/loss state some finite large number(though written as INF). So, we need to make the value variable smaller/larger than the INF variable.
...
On 2018年9月24日 at 22:21, Ashish Acharya ***@***.***> wrote: ***@***.**** commented on this pull request. ------------------------------ In Engine.py <#2 (comment)>: > @@ -37,7 +38,7 @@ def minmax(self, is_max=True, depth=0, alpha=-INF, beta=INF): # find the minimum attainable value for the minimizer if not is_max: - value = self.INF Why replace INF? — You are receiving this because you authored the thread. Reply to this email directly, view it on GitHub <#2 (review)>, or mute the thread <https://github.com/notifications/unsubscribe-auth/ATrAN4jyKBrMhYS9QTziqN1VcLO_CHgCks5ueQolgaJpZM4W2uOG> .

@code-geek code-geek merged commit c5c8f1c into code-geek:master Sep 25, 2018
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Reviewers

@code-geek code-geek code-geek left review comments

Assignees

No one assigned

Labels

None yet

Projects

None yet

Milestone

No milestone

Development

Successfully merging this pull request may close these issues.

AltStyle によって変換されたページ (->オリジナル) /