Dominion Strategy Forum

Please login or register.

Login with username, password and session length

Show Posts

This section allows you to view all posts made by this member. Note that you can only see posts made in areas you currently have access to.

Messages - heron

Filter to certain boards:

Pages: 1 [2] 3 4 ... 44
26
Solo Challenges / Re: Another infinite loop
« on: April 12, 2020, 03:18:22 pm »
Can do 1 kingdom card a 2 landscapes:

KC-KC (way of the rat, way of the horse to draw new KC + treasure, play new KC, repeat)

Donald says we should avoid using 2 Ways. But sounds nice.

You can replace way of the rat with inventor.

27
Rules Questions / Re: Cost of Animal Fair revisited
« on: April 11, 2020, 10:59:26 pm »
I think it is clear that when Donald said that Animal Fair has an alternate cost of trashing an action, he isn't using cost as a formal term.
Obviously if there was another card that was like you can trash an action and pay $2 to buy it but it normally cost 25 then you could not remodel animal fair into this hypothetical card.

28
Solo Challenges / Re: Another infinite loop
« on: April 11, 2020, 10:29:38 pm »
Can do 1 kingdom card a 2 landscapes:

KC-KC (way of the rat, way of the horse to draw new KC + treasure, play new KC, repeat)

29
General Discussion / Re: Maths thread.
« on: February 04, 2020, 02:38:44 pm »
I found an optimal strategy:


Index the players 1-127.
Each player computes the XOR of the indices of the players with red hats.
If it is 0, they guess that they have a red hat.
If it is their own index, they guess that they have a black hat.
Otherwise, they abstain.

Thoughts on how to come up with this strategy:
Since each guess is correct with 50% probability, in order to maximize the chance of winning we need to make it so that when someone guesses wrong, everyone else does too, and when someone guess right they are the only one to guess.
The easiest example of this sort of behavior is a situation where a player guesses that they have a red hat if all other players have a black hat.
Then everyone guesses wrong if there are all black hats, and exactly one person guesses correctly if there is exactly one red hat.

Basically, we need to tile the space with clusters consisting of a center state (where everyone guesses wrong) and all the adjacent states.
Due to the way that switching a hat color twice doesn't change the state, it seemed natural to use some sort of XOR condition.
So, I picked the states where everyone guesses wrong to be the states where the XOR of the indices of red hats to be 0.
You could pick a different number besides 0 if you want.


That said, here is a similar problem from the most recent putnam:

Let Z^n be the integer lattice in R^n. Two points in Z^n are called neighbors if they differ by exactly 1 in one coordinate and are equal in all other coordinates.
For which integers n ≥ 1 does there exist a subset S of Z^n satisfying the following two conditions?
(1) If p is in S, then none of the neighbors of p is in S.
(2) If p is not in S, then exactly one of the neighbors of p is in S

30
Dominion General Discussion / Re: Improving play at 3+ players
« on: February 01, 2020, 06:34:52 pm »
I will make a note on this argument.

Until the curses (would have) run out, the rate at which you receive curses is independent of whether or not you buy witch.
Instead, buying witch affects the rate at which the other players receive curses, and does so to the same extent in both 2p and 3p.

31
General Discussion / Re: Maths thread.
« on: January 28, 2020, 09:06:59 pm »

And, for hat problem number 1:
Decide ahead of time to always guess odd or always even. Then everyone is guessing the same hat distribution.  This produces a 50% chance of victory, because there's an equal number of even and odd distributions.

I think this is the right idea, but there isn’t the same number of odd and even distributions. So we would actually have to check what are the odds of having an odd number of white hats, total, and compare with the odds of having an even number. Then everybody agrees to guess the hat color that leads to a total number of white hats that is odd/even, depending on their previous result.

No, see the exchange earlier with MiX and bitwise. bitwise is correct.

32
General Discussion / Re: Maths thread.
« on: January 24, 2020, 11:02:00 pm »
2. Similar to the previous problem, but there are 127 players. Furthermore, each player simultaneously guesses their hat color OR abstains. The players win if all guesses are correct and there was at least one guess, and otherwise, they all lose. What is the maximum probability of victory that they can achieve?

This one... I think this is the answer.

50%.

With the distribution being completely random, there's no way any single person can have more than a 50% chance to guess their own hat colour. No amount of planning a way a person might decide to guess or not guess will give them a better than 50% chance when they actually make their guess. Therefore, one person is designated to guess at random, while everyone else abstains. The person making a guess then has a 50% chance to guess correctly, making everyone win.


This is not correct. Consider the game with 3 people and the strategy of guessing the opposite color if both other players have the same color hat.

It is true that 50% of guesses made are incorrect, but you can load it so that many wrong guesses are made at once, and when a correct guess is made it is the only guess.

33
General Discussion / Re: Maths thread.
« on: December 08, 2019, 04:30:44 pm »
I found it about the same as usual; I was very disappointed after the test when I realized I misread B5. For some reason I thought it said f(n) = F_{2n + 1} instead of f(2n + 1) = F_{2n + 1}. I had solved a problem that was basically the same as the actual problem before, but the technique could not solve the problem they way I had read it. If I had read more carefully I would almost surely have got it...

I think B6 was unusually easy this year; it was definitely the problem that took me the least time to solve.
A1 and B1 were perhaps more difficult/time consuming than usual.

34
General Discussion / Re: Maths thread.
« on: December 04, 2019, 03:25:23 pm »
Yea it's my last year for it.

35
Puzzles and Challenges / Re: Slowest trashing kingdom
« on: September 25, 2019, 06:07:44 pm »
There is also no need for watchtower in the bard kingdom. Just bard + death cart works.

36
Puzzles and Challenges / Re: Slowest trashing kingdom
« on: September 24, 2019, 11:53:27 pm »
trader + death cart seems pretty slow.

37
Dominion General Discussion / Re: ThunderDominion Card List Results, 2019
« on: September 06, 2019, 02:54:44 pm »
IMO upgrade should be 3rd. Maybe 2nd. Upgrade >> steward.

38
General Discussion / Re: Maths thread.
« on: June 28, 2019, 08:51:54 pm »
Sorry this explanation is kind of poorly written.

Note that for x coprime to 2^32, x^(2^30) = 1 mod 2^32.

Suppose that a has maximum order, i.e. a^k ≠ 1 for 0 < k < 2^30.
Let n = c0 + c1*2 + c2*2^2 + ... + c29*2^29.
(a^n)^(2^29) = c^(2^29)
so
a^(c0 * 2^29) = c^(2^29)
Since a has maximum order, exactly one of c0 = 0 and c0 = 1 will work. And then you can proceed like that to find the other ci.
So where does LTE come in?

Well, since a and c are both 1 mod 4, v2((a^c0)^(2^29) - c^(2^29)) = v2(a^c0 - c) + v2(2^29).
We know the LHS is either 32 or <32 depending on choice of c0. So RHS is either 3 or <3 depending on choice of c0.
Similar argument applies for other ci.

Why v2(a-1) = v2(c-1)?
Well, earlier I had this assumption that a had maximal order. That may not be true. However, if a = 1 mod 4, then o(a) = 32 - v2(a - 1).
So a and c have the same order.
Let that order be 2^h.
Then we can do stuff like
a^(c0*2^(h-1)) = c^(2^(h-1)) for exactly one choice of c0.

39
General Discussion / Re: Maths thread.
« on: June 24, 2019, 08:49:17 pm »
People were able to compute plenty of derivatives perfectly well far before any of the modern rigorous notions of limits, which was primarily due to Cauchy. They did so mostly with "handwaving."

The key issue here is more subtle, and it's more about being circular than being handwavy. The approximation e^h = 1+h when h is small is only valid for the number e. It's equivalent to the fact that the tangent line to the graph of e^x at x=0 is y=1+x, which can't be established without knowing that the derivative of e^x is e^x in the first place.

Still not quite sure I understand. Doesn't x^h approach 1+h as h approaches 0 for any positive x?

The "handwaving" is just a less formal way of talking about limits, right?

It actually approaches 1 + hlogx. But since log(e) = 1, for e^h it is 1 + h.

Edit: Well, you can say that lim as h-->0 of | x^h - (1 + h) | = 0. But that is only because both of the quantities approach 1. It is more meaningful to consider the difference relative to h, which just gives the limit of the derivative: (x^h - (1 + h)) / h

40
General Discussion / Re: Maths thread.
« on: June 01, 2019, 02:18:06 pm »
This isn't a great reason, but if you multiply 72 or 288 by 2.5 you get 180 mod 360. It's not a great reason because if you multiply (72 + 360) by 2.5 you get 360 again.

It's also not true: 288*2.5 = 720, while 216 * 2.5 = 240.

Well, fair enough.

41
General Discussion / Re: Maths thread.
« on: June 01, 2019, 11:45:00 am »
I'm somewhat confused about complex numbers right now. Or rather about how WolframAlpha deals with them, which is presumably the correct way.

If I ask for solutions to the equation x^5 = 1, it gives me all the complex numbers with angles n * 72°, n = 0,1,2,3,4. (Left.) If I ask for solutions to the equation x^{5/2} = 1, it gives me the ones with n = 0, 2, 3. (Right)

 

So what exactly is the property that the points with angles 72° and 288° don't have?

This isn't a great reason, but if you multiply 72 or 288 by 2.5 you get 180 mod 360. It's not a great reason because if you multiply (72 + 360) by 2.5 you get 360 again.

42
Tournament + Herald

Used Herald overpay to topdeck province and tournament. I bought an early province and got 3 prizes with it on my next shuffle.

Something tells me that would have taken multiple shuffles...

Well, not if you keep buying herald, and avoid drawing too many cards.

43
Puzzles and Challenges / Re: Easy Puzzles
« on: March 13, 2019, 08:40:06 pm »
Alternatively, Summon - Mission

44
Puzzles and Challenges / Re: Unbounded scoring in a single action
« on: March 10, 2019, 06:27:40 pm »
Does buying a temple or gaining an estate with wild hunt satisfy the requirements?

45
Fortune could basically be reworded to have a buy restriction if you want... "You can't gain or buy this unless 5 Gladiators have been gained this game". (Yes it's not the same in all cases, but it is in most cases). To me, having 5 cards sitting on top of the card is absolutely a buy restriction.

That's besides the point. If my opponent gains 5 Gladiators, I can buy Fortune for $8D8 without ever gaining any Gladiators.

This isn't the point you are making but also it's very false that you can't get fortune unless 5 gladiators have been gained. A lot of gladiators get trashed from the supply.

46
Instead of comparing Ducat to Candlestick Maker, we should really be comparing it to Market Square.

Isn't that like comparing Gold to Smithy? How does that work?

Well, if you buy it and trash a copper, ducat is like a nonterminal +buy that doesn't take up space in your deck for $3.
Market square is also like that.


47
Dominion League / Re: Season 32 - Signups
« on: January 27, 2019, 11:03:01 pm »
New league player:

Dominion: heron
Discord: @heron#0905
Time Zone: America/New_York

48
According to some stats markus (I think) compiled, black market is still one of the cards that most favors the more skilled player today.
Also, I'm pretty sure that there are no potion cards in the black market unless a potion card is already in the kingdom. Similarly, you don't find travellers and a few other cards (not quite sure which) in the black market.

49
Dominion General Discussion / Re: Are promos worth it?
« on: January 14, 2019, 05:22:18 pm »
I feel like using the randomizer deck and then just grabbing actual copies of whatever cards get bought is a pretty good compromise.

50
Jack / Cathedral
Nothing too special here but it's very fast. I got 6 provinces in 12 turns.

Pages: 1 [2] 3 4 ... 44

Page created in 0.141 seconds with 19 queries.