Jump to content

  • Log In with Google      Sign In   
  • Create Account


#Actualmudslinger

Posted 10 October 2012 - 08:07 AM

Hello,

We have this game with 4 players where each players take turns to discard cards that must be higher than the ones previously discarded. The card combinations are based on poker. Discarded cards are visible to everyone. The last player with remaining cards loses. I have code on the gameplay, and the AI has code that can list valid combinations from the cards that it has.

I'm planning to use Monte Carlo playouts:
For each move M {
  Do 10,000 times {
	Generate a plausible configuration for the cards of the opponents
	Play M
	Run the rest of the game randomly (room for improvement here)
  }
  Count how often you won
}
Pick the move that won the most.
What do you think?

#4mudslinger

Posted 10 October 2012 - 08:06 AM

Hello,

We have this game with 4 players where each players take turns to discard cards that must be higher than the ones previously discarded. The card combinations are based on poker. Discarded cards are visible to everyone. I have code on the gameplay, and the AI has code that can list valid combinations from the cards that it has.

I'm planning to use Monte Carlo playouts:
For each move M {
  Do 10,000 times {
	Generate a plausible configuration for the cards of the opponents
	Play M
	Run the rest of the game randomly (room for improvement here)
  }
  Count how often you won
}
Pick the move that won the most.
What do you think?

#3mudslinger

Posted 10 October 2012 - 08:06 AM

Hello,

We have this game with 4 players where each players take turns to discard cards that must be higher than the ones previously discarded. The card combinations are based on poker. Discarded cards are visible to everyone. I have code on the gameplay, and the AI has code that can list valid combinations from the cards that it has.

I'm planning to use Monte Carlo playouts:
For each move M {
  Do 10,000 times {
	Generate a plausible configuration for the cards of the opponents
	Play M
	Run the rest of the game randomly (room for improvement here)
  }
  Count how often you won
}
Pick the move that won the most.
What do you think?

#2mudslinger

Posted 10 October 2012 - 08:04 AM

Hello,

We have this game with 4 players where each players take turns to discard cards that must be higher than the ones previously discarded. The card combinations are based on poker. I have code on the gameplay, and the AI has code that can list valid combinations from the cards that it has.

I'm planning to use Monte Carlo playouts:
For each move M {
  Do 10,000 times {
	Generate a plausible configuration for the cards of the opponents.
	Play M
	Run the rest of the game randomly (room for improvement here)
  }
  Count how often you won
}
Pick the move that won the most.
What do you think?

#1mudslinger

Posted 10 October 2012 - 08:03 AM

Hello,

We have this game with 4 players where each players take turns to discard cards that must be higher than the ones previously discarded. The card combinations are based on poker. I have code on the gameplay, and the AI has code that can list valid combinations from the cards that it has.

I'm planning to use Monte Carlo playouts:

For each move M {
Do 10,000 times {
Generate a plausible configuration for the cards of the opponents.
Play M
Run the rest of the game randomly (room for improvement here)
}
Count how often you won
}
Pick the move that won the most.

What do you think?

PARTNERS