Show newer

@pthenq1 Everyone who died at the incident were trump supporters. One cop died several days later, but thats it.

Moreover the democrats were actively trying to kill trump going as far as using bricks as weapons. Either they are both 100% insurrection or neither were. Democrats literally burned buildings and homes to the ground for the better part of a year. No way in hell you can justify them as the good guys.

@pthenq1

WASHINGTON — Inside the White House, the mood was bristling with tension. Hundreds of protesters were gathering outside the gates, shouting curses at President Trump and in some cases throwing bricks and bottles. Nervous for his safety, Secret Service agents abruptly rushed the president to the underground bunker used in the past during terrorist attacks.

nytimes.com/2020/05/31/us/poli

Remind me again how superior the democrats were. We spent a year of them burning down entire cities and they did the same at the capitol

@pthenq1 Well for starters if you call violence against the government buildings in DC as insurrection, then the democrats engaged insurrection first, going so far as requiring Trump to be taken to a secure bunker when a democratic "insurrection" threatened his life.

Second, the circulation problems sounds like Vascular dementia to me then, so ill go with that :)

Which type of dementia do you think has?

Which personality disorders do you think has?

@khird
Ill work through my logic on 6 boxes tomorrow. I think i see how to solve it but i need to get it on paper, see if there is a hole in my logic. Also will be helpful to nail down a workable notation.

@khird
I think if you select 3 you can solve 5 or 6 boxes, you dont need 4 to solve 6 just 3. So its not number of boxes minus 2.

@khird
So new problem, given a certain number of boxes, and a number of flips per round, how can we determine if it is solvable, and the number of rounds needed to garuntee a solve, assuming an oracle.

@khird
With 4 boxes you have two modes of selecting, adjacent or across, with 5 boxes you also have 2 modes of operation, adjacent or skip one, and you cant do opposite. But with 6 boxes you get 3 modes, adjacent, skip one, or across. I need to think about this some more but i suspect if a certain number of boxes is solvable depends on the number of modes. Compared to number of boxes. It may be (i need to ponder) that 6 boxes is solvable where 5 is not.

@khird
So proof of impossiblity is this.

Imagine you are so unlucky that every time you pick two cups, even if you alternate adjacent and opposite picks, you always keep picking the 2 out of the same 3 cups. In other words your so unlucky you never pick one specific cup.

No matter what you do the state of that one cup is always unknown to you and therefore you can never garuntee you will end any one round in a winning state.

@khird
Mathematically proving there is no solution to a conjecture is often itself an extremely hard task. That said i may be able to articulate why it isnt solvable if i give it some thought.

Any solution relies on first getting the coins to a state where you have 3 coins the same and the state of the 4th is unknown. The problem is i dont see how you can ever deduce the unknown state without an oracle since you can spin it as many times as you want and may always get the same choices every time. Flip it all you want and you can never find the unknown state without an oracle.

@khird without an oracle telling you that you've won i dont think its possible to do because of the random element.

@khird as far as i know the smallest N for a garunteed win is 5, you can sometimes win sooner but 5 is the smallest garunteed.

@cosas two random strangers trading property have a free market scenario in that exchange.

Show older
CleverLibre Social

CleverLibre Social is an inclusive social instance for open discussion, learning, and community.
All cultures welcome.
Hate speech and harassment strictly forbidden.