101 reputation
2
bio website stackoverflow.com/users/…
location somewhere in Canada
age
visits member for 3 years, 10 months
seen Oct 16 at 21:39

Jan
3
comment Is there a general, algebraic way of solving this seating arrangement problem?
Ok, I guess one way of categorizing this type of problem is a Constraint satisfaction problem, and backtracking is actually a half decent way to solve these!
Jan
3
answered Is there a general, algebraic way of solving this seating arrangement problem?
Jan
3
comment Is there a general, algebraic way of solving this seating arrangement problem?
This isn't really what I'm looking for, but you get a +1 for the neat trick in your first sentence. Nice.
Jan
3
comment Is there a general, algebraic way of solving this seating arrangement problem?
Yup. I'm really just looking for the "mathy" way of solving it.
Jan
3
asked Is there a general, algebraic way of solving this seating arrangement problem?
Dec
17
comment Monty hall problem extended.
The down votes he received are because he's wrong. Just look at some of the other examples (like the ones with 100 doors). You had a 33% chance of being correct in your initial pick. Monty removing a door cannot change your original probability retroactively. If you were to run this experiment 100 times, NOT switching doors will give you a win about 33% of the time (try it!). Switching will win about 50%.
Jun
5
awarded  Informed
Jan
6
awarded  Supporter