There appears to be a class of problem that BN's are not designed to solve. These are problems involving (probabilistic) simulation of two player games where cycles are required to be followed to calculate the probability of nodes that effectively have circular references. The program Netica does a clever kludge by simply duplicating the whole network for solving iterations of this kind. I suspect that there may be other ways such as enforcing timing limitations on calculation.
Does anybody have any other ideas on how to use a BN in the context of 'two player games' to solve the circular reference problem? Regards, Julian Russell USQ
