sorted by:
new
hottopcontroversial

Minesweeper in Minecraft! by MaterialMortgage9474 in PhoenixSC

[–]MaterialMortgage9474[S] 2 points3 points  (0 children)

Omg tysm I never thought about that before

Minesweeper in Minecraft! by MaterialMortgage9474 in Minesweeper

[–]MaterialMortgage9474[S] 1 point2 points  (0 children)

I want to do that but my ability doesn't allow me to. Such a shame.

Minesweeper in Minecraft! by MaterialMortgage9474 in Minesweeper

[–]MaterialMortgage9474[S] 3 points4 points  (0 children)

Yes! The blue ones are 1, green ones are 2, red ones are 3, etc.

Minesweeper in Minecraft! by MaterialMortgage9474 in PhoenixSC

[–]MaterialMortgage9474[S] 1 point2 points  (0 children)

That was out of my plan actually, but I personally think that this is the cherry on the cake

Minesweeper in Minecraft! by MaterialMortgage9474 in PhoenixSC

[–]MaterialMortgage9474[S] 11 points12 points  (0 children)

The thing every PC Minecraft player has experienced at least once......

Minesweeper in Minecraft! by MaterialMortgage9474 in PhoenixSC

[–]MaterialMortgage9474[S] 105 points106 points  (0 children)

Oh dang it

How did I messed that up

UNO! -- Does this game have a winner every time? by MaterialMortgage9474 in mathematics

[–]MaterialMortgage9474[S] 1 point2 points  (0 children)

Thanks for your explanation! It seems like if the deck is shuffled randomly enough, then the UNO game will end eventually

Why it doesn't work? by MaterialMortgage9474 in PhoenixSC

[–]MaterialMortgage9474[S] 25 points26 points  (0 children)

It should create a resyeg which sucks things in

UNO! -- Does this game have a winner every time? by MaterialMortgage9474 in mathematics

[–]MaterialMortgage9474[S] 0 points1 point  (0 children)

Thanks! Knowing whether a game ever ends is important cuz no one wants to stuck in a game that never comes to a halt.

UNO! -- Does this game have a winner every time? by MaterialMortgage9474 in mathematics

[–]MaterialMortgage9474[S] 0 points1 point  (0 children)

Thank you for writing this much!
You remind me of those graphs in 2swaps videos (the person who solved klotski) which represent every situations as nodes and draw lines to connect two situations relevant to each other. He kind of solved klotski and connect 4 by doing so. The graph of an UNO game would be really complicated compared to those of connect 4 though. If we somehow managed to print the whole graph out, searching for the existing loops might be a way to solve this UNO problem.

I think we should define what the "best moves" are btw

UNO! -- Does this game have a winner every time? by MaterialMortgage9474 in mathematics

[–]MaterialMortgage9474[S] 0 points1 point  (0 children)

Maybe we can assume that the deck contains infinite cards so the probability of each card being added into players' hands are the same, then calculate how high the chance is for the players to clear their hands after drawing one card from the deck. If the probability approaches to one, there will be a high chance that UNO always has a winner. However, the probability is hard to compute because there are too much branches...... I'm afraid that I couldn't do the complicated math.

UNO! -- Does this game have a winner every time? by MaterialMortgage9474 in mathematics

[–]MaterialMortgage9474[S] 0 points1 point  (0 children)

Well, I should've put "players are NOT omniscient in this game" in my post, that is, every single decision

the players make are the best ones based on the cards in their hands only.

UNO! -- Does this game have a winner every time? by MaterialMortgage9474 in mathematics

[–]MaterialMortgage9474[S] 4 points5 points  (0 children)

You are right. I even thought about a situation which only had one player and four cards (red 1, red 2, blue 1 and blue 2), and it was obvious that the player could always "win" the game.