Questions tagged [imperfect-information]

Use for models where all previous actions/states are not known by participants. Distinct from Incomplete Information. Imperfect Information may be a subset of the blanket term "Hidden Information"

6 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
6
votes
2answers
351 views

In this implementation of the Information Set Monte Carlo Tree Search, why can't the players see the cards of each other?

After reading this paper about Monte Carlo methods for imperfect information games with elements of uncertainty, I couldn't understand the application of the determinization step in the author's ...
3
votes
0answers
88 views

Why multiplayer, imperfect information, trick-taking card games are hard for AI?

AI reached a super-human level in many complex games such as Chess, Go ,Texas hold’em Poker, Dota2 and StarCarft2. However it still did not reach this level in trick-taking card games. Why there is no ...
3
votes
0answers
240 views

What is the state of the art AI training technique for imperfect information 2 player turn based games?

As far as I can tell (correct me if I'm wrong), Alphazero (with MCTS and neural network heuristic function RL) is the state of the art training method for turn based, deterministic, perfect ...
2
votes
0answers
306 views

How do to mitigate or design out hidden feedback loops when designing ML systems?

Two months ago, I've found myself working on a churn detection problem which can be briefly described as follows: Assume the current date is N Use customer behavior for N-1,..N-x dates to develop ...
1
vote
0answers
50 views

What to study for this simple poker game?

I'm a programmer with a background in mathematics, but I have no experience whatsoever with artificial intelligence/neural networks. I'd like to study it as a hobby, and my goal for now is to solve ...
0
votes
0answers
28 views

Partial pruning in counterfactual regret minimization (CFR)

I'm using CFR to solve a large imperfect-information game. One important technique for optimizing performance of this algorithm is "partial pruning", which allows the algorithm to skip ...