Game Development Stack Exchange is a question and answer site for professional and independent game developers. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

i want to develop an AI opponent for the Board Game Monopoly. I want to implement the whole Game with Prolog (XPCE). The probability for a field on the Board being hit, can be computed with Markov Chains. I already know some "best practices" like "after 50% of the playing time it does not make sense to buy out of jail because in jail you get renting fees for your fields but you don't have to pay for other fields as long as you stay in prison". The interesting question always is: buy a streetfield ? buy houses / hotels ? how much ? so i think i would have to compute some kind of future liquidity .. does anyone know how to pack that into an algorithm or how to translate it to prolog ?

share|improve this question

closed as off-topic by Josh Petrie Jan 2 '14 at 18:38

  • This question does not appear to be about game development within the scope defined in the help center.
If this question can be reworded to fit the rules in the help center, please edit the question.

Googling for good strategy to play Monopoly game will show you a lot of resources on that. Don't count probabilities, for everyone that ever played Monopoly it is obvious to buy as many fields as you can, even by mortgaging some of the fields. You need to get the monopoly = all fields of a kind to really get started making money. – Markus von Broady Nov 6 '12 at 9:42
This question appears to be off-topic because it is about strategies for playing a game... further, the portion that isn't asking for strategy is asking for help with the basic task of translation an algorithm to code. – Josh Petrie Jan 2 '14 at 18:38

Browse other questions tagged or ask your own question.