Weighted move rating for AI
up vote
1
down vote
favorite
My AI (for the card game schnapsen) currently calculates every possible way the game could end and then evaluates the percentage of winning for every playable card.
The calculation is done recursively using a tree. If a game could move on in three different ways the percentage of winning on this node would be mean * (1 - (standardDeviation * f)) * 100
where f is between 0 and 2. When the game can't move on and the AI wins the percentage is 100, when lost 0. I'm including the standard deviation in this formula to prevent the AI from risking too much.
Is there a better formula or way of calculating the next move to maximize the chance of winning? Does including the standard deviation make sense?
algorithm artificial-intelligence
add a comment |
up vote
1
down vote
favorite
My AI (for the card game schnapsen) currently calculates every possible way the game could end and then evaluates the percentage of winning for every playable card.
The calculation is done recursively using a tree. If a game could move on in three different ways the percentage of winning on this node would be mean * (1 - (standardDeviation * f)) * 100
where f is between 0 and 2. When the game can't move on and the AI wins the percentage is 100, when lost 0. I'm including the standard deviation in this formula to prevent the AI from risking too much.
Is there a better formula or way of calculating the next move to maximize the chance of winning? Does including the standard deviation make sense?
algorithm artificial-intelligence
2
This is a pretty big question on a very big subject. i would suggest asking it at ai.stackexchange.com
– Dinari
Nov 11 at 12:19
add a comment |
up vote
1
down vote
favorite
up vote
1
down vote
favorite
My AI (for the card game schnapsen) currently calculates every possible way the game could end and then evaluates the percentage of winning for every playable card.
The calculation is done recursively using a tree. If a game could move on in three different ways the percentage of winning on this node would be mean * (1 - (standardDeviation * f)) * 100
where f is between 0 and 2. When the game can't move on and the AI wins the percentage is 100, when lost 0. I'm including the standard deviation in this formula to prevent the AI from risking too much.
Is there a better formula or way of calculating the next move to maximize the chance of winning? Does including the standard deviation make sense?
algorithm artificial-intelligence
My AI (for the card game schnapsen) currently calculates every possible way the game could end and then evaluates the percentage of winning for every playable card.
The calculation is done recursively using a tree. If a game could move on in three different ways the percentage of winning on this node would be mean * (1 - (standardDeviation * f)) * 100
where f is between 0 and 2. When the game can't move on and the AI wins the percentage is 100, when lost 0. I'm including the standard deviation in this formula to prevent the AI from risking too much.
Is there a better formula or way of calculating the next move to maximize the chance of winning? Does including the standard deviation make sense?
algorithm artificial-intelligence
algorithm artificial-intelligence
asked Nov 11 at 12:12
GraxCode
2415
2415
2
This is a pretty big question on a very big subject. i would suggest asking it at ai.stackexchange.com
– Dinari
Nov 11 at 12:19
add a comment |
2
This is a pretty big question on a very big subject. i would suggest asking it at ai.stackexchange.com
– Dinari
Nov 11 at 12:19
2
2
This is a pretty big question on a very big subject. i would suggest asking it at ai.stackexchange.com
– Dinari
Nov 11 at 12:19
This is a pretty big question on a very big subject. i would suggest asking it at ai.stackexchange.com
– Dinari
Nov 11 at 12:19
add a comment |
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Stack Overflow!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53248632%2fweighted-move-rating-for-ai%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
2
This is a pretty big question on a very big subject. i would suggest asking it at ai.stackexchange.com
– Dinari
Nov 11 at 12:19