Logic / Probability Question: Picking from a bag

Posted by Rosarch on Stack Overflow See other posts from Stack Overflow or by Rosarch
Published on 2009-11-29T06:12:12Z Indexed on 2010/04/03 7:43 UTC
Read the original article Hit count: 577

Filed under:

logic

|

probability

|

game-design

I'm coding a board game where there is a bag of possible pieces. Each turn, players remove randomly selected pieces from the bag according to certain rules.

For my implementation, it may be easier to divide up the bag initially into pools for one or more players. These pools would be randomly selected, but now different players would be picking from different bags. Is this any different?

If one player's bag ran out, more would be randomly shuffled into it from the general stockpile.

© Stack Overflow or respective owner

Related posts about logic

Business Logic Layer Pattern on Rails? MVCL

as seen on Stack Overflow - Search for 'Stack Overflow'
That is a broad question, and I appreciate no short/dumb asnwers like: "Oh that is the model job, this quest is retarded (period)" PROBLEM Where I work at people created a system over 2 years for managing the manufacture process over demand in the most simplified still broad as possible, involving… >>> More
What is the correct way to deal with similar but independent features?

as seen on Programmers - Search for 'Programmers'
Let's say we have a feature request come in and we begin work on it, which we'll call feature-1. It introduces some new logic to the application, which we'll call logic-A and logic-B. A programmer branches from the release branch and begins work on the feature. Soon after, we get another feature… >>> More
What is up with the Joy of Clojure 2nd edition?

as seen on Programmers - Search for 'Programmers'
Manning just released the second edition of the beloved Joy of Clojure book, and while I share that love I get the feeling that many of the examples are already outdated. In particular, in the chapter on optimization the recommended type-hinting seems not to be allowed by the compiler. I don't know… >>> More
Transforming Business Logic into Web Services Using DB2 9.5 and IBM Data Studio

as seen on Internet.com - Search for 'Internet.com'
Learn how to take business logic such as stored procedures, functions, or SQL statements and turn them into a Web service. >>> More
Identifier for the “completed” stage of a process: 0, 99, something else?

as seen on Programmers - Search for 'Programmers'
Say, that you are handling a multi-step process (like a complex registration form, with a number of steps the user has go through in order). You need to be able to save the current state of the process (e.g. so the user can come back to that registration form later and continue form the step where… >>> More

Related posts about probability

Logic / Probability Question: Picking from a bag

as seen on Stack Overflow - Search for 'Stack Overflow'
I'm coding a board game where there is a bag of possible pieces. Each turn, players remove randomly selected pieces from the bag according to certain rules. For my implementation, it may be easier to divide up the bag initially into pools for one or more players. These pools would be randomly selected… >>> More
Combinatorics, probability, dice

as seen on Stack Overflow - Search for 'Stack Overflow'
A friend of mine asked: if I have two dice and I throw both of them, what is the most frequent sum (of the two dice' numbers)? I wrote a small script: from random import randrange d = dict((i, 0) for i in range(2, 13)) for i in xrange(100000): d[randrange(1, 7) + randrange(1, 7)] += 1 print… >>> More
probability and relative frequency

as seen on Stack Overflow - Search for 'Stack Overflow'
If I use relative frequency to estimate the probability of an event, how good is my estimate based on the number of experiments? Is standard deviation a good measure? A paper/link/online book would be perfect. http://en.wikipedia.org/wiki/Frequentist >>> More
Probability Selector

as seen on Dr Dobbs - Search for 'Dr Dobbs'
For when you really do need randomness Probability - Math - Event - Teaching Resources - Past Events >>> More
reservoir sampling problem: correctness of proof

as seen on Stack Overflow - Search for 'Stack Overflow'
This MSDN article proves the correctness of Reservoir Sampling algorithm as follows: Base case is trivial. For the k+1st case, the probability a given element i with position <= k is in R is s/k. The probability i is replaced is the probability k+1st element is chosen multiplied by i being… >>> More