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

[Bug?] Different results when doing an "unrestricted challenge" vs just always doing the search #4

Open
neongreen opened this issue Jun 26, 2023 · 0 comments

Comments

@neongreen
Copy link
Owner

See golden-games.ts. For whatever reason the generated games are slightly different compared to just always using 'search.findBestMove'.

I spent an hour (?) investigating and I have no idea why. It'd be nice to walk through 'findBestMove' with the debugger. Maybe it's due to the transposition table?

Update: possibly because when we reach depth=0 in the search, we don't actually detect draws/checkmate, we just use leaf eval - but evaluateBoard does do detection at depth=0, which is an inconsistency.

Update 2: I tried changing evaluateBoard to use leaf eval, but it just got worse.

@neongreen neongreen self-assigned this Jun 28, 2023
@neongreen neongreen removed their assignment Jul 8, 2023
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