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

Compare algorithms #5

Open
erik-stephens opened this issue Jan 24, 2013 · 0 comments
Open

Compare algorithms #5

erik-stephens opened this issue Jan 24, 2013 · 0 comments
Milestone

Comments

@erik-stephens
Copy link
Owner

Will want a way to compare how effective one algorithm is vs another. Write a script to pit one algorithm against another. The result will include the winning color and the distance the opponent had to finish. The distance will be calculated as:

sum(piece.point - piece.color.home for point in all_points)

Might be valuable to try to quantify how lucky the winner was. Will be difficult for sure and not sure how insightful it will be. Probably better to just run more simulations to take the randomness of the dice out of the equation.

While computer vs computer simulations might not be representative of computer vs human, it should be a good way to compare which algorithms will be the most successful. In other words, I wonder if there will be an algorithm A that can kill algorithm B, but when matched against a human, algorithm B is actually more successful.

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

No branches or pull requests

1 participant