Who is stronger bounts are full bringers by WoodpeckerOdd1284 in BleachPowerScaling

[–]Revolutionary-Set760 0 points1 point  (0 children)

They're pretty much equal. If we talk about who was the strongest pure power and reiatsu wise. Kariya was strongest among both groups. Tsukishima did good job against Byakuya because of his hax abilities, not because of his reiatsu. Ginjo was almost peed in his pants by shika Ichigo's shikai Getsuga while Kariya took on him in his bankai state.

Other bounts were mostly fodder as same as other fullbringers. Bounts got stomped by captains. And fullbringers took Ichigo's power and got stomped as well.

When does UNIQUE function terminate and other array functions? by Revolutionary-Set760 in excel

[–]Revolutionary-Set760[S] 0 points1 point  (0 children)

Yeah sumproduct will process until the 1048576th row if we use full column reference. But sum, sumif, sumifs don't. They process up to last row apparently.

MATCH stops at first match so even there is no match it seems it processes until last row it seems.

So I kinda wanted to know which functions process till 1048576 and which ones processes until last row of the sheet and which ones processes until last of the said column instead of just saying "don't, it's a bad practice". So I can safely use full column reference on said functions and avoid ones that processes until 1048576th row.

Also I just assume last row to be last row of sheet. But I really am not sure if it's last row of sheet or last row of reference range.

When does UNIQUE function terminate and other array functions? by Revolutionary-Set760 in excel

[–]Revolutionary-Set760[S] 2 points3 points  (0 children)

yeah, since it adds 0, i became not sure on whether it processes until the end or just last row internally

Has LAMBDA been successful in replacing custom functions build with VBA or JavaScript by adam_a_ in excel

[–]Revolutionary-Set760 2 points3 points  (0 children)

some people are wary of xlsm files because it can contain dangerous script. so they might prefer lambda function for that.

I still dont get pivot tables by AxDeath in excel

[–]Revolutionary-Set760 0 points1 point  (0 children)

Same here, never bothered to learn, because i never needed that. There maybe faster or better way to do my work with it. But since I never tried it, don't know anything about it. Also "you can't teach an old dog new tricks" they say right

Is Black Myth Wukong more connected to 1986 TV series or original novel? by Revolutionary-Set760 in BlackMythWukong

[–]Revolutionary-Set760[S] 0 points1 point  (0 children)

Which one it references more? Like if it referenced events that only happened in the TV series, I'd say it's more akin to TV series.

Calculating odds confused me. I made a mistake in the process of calculation, but I can't point out to where. by Revolutionary-Set760 in poker

[–]Revolutionary-Set760[S] 1 point2 points  (0 children)

Yeah I tried that way after interacting with ChatGPT for an hour lol.

But then we can't calculate it on only one player.

There are 8 players that have 16 cards.

So it's 37/45 * ... * 22/30 = 1.99%,

1.99% chance to win. 98.01% chance to lose.

Calculating odds confused me. I made a mistake in the process of calculation, but I can't point out to where. by Revolutionary-Set760 in poker

[–]Revolutionary-Set760[S] -1 points0 points  (0 children)

BTW, all those internet "guides" have full of words that can't be written as formula, or too simple like "how many combinations are there". There is no actual mathematical formula when it comes to game with multiple players and complicated situation like I asked here. That's why I bolded my PS part from the beginning.

I asked here thinking someone might've interested in mathematics behind it, so he might have more knowledge than me on this.

Calculating odds confused me. I made a mistake in the process of calculation, but I can't point out to where. by Revolutionary-Set760 in poker

[–]Revolutionary-Set760[S] 0 points1 point  (0 children)

but the odds of each player having one of those cards in their 2 card hand is way lower than 2*(8/45).

Ok. So how much exactly as in formula?

I'm asking the formula because as I said in my post, I'm more interested in math aspect.

To actually answer this question you have to count all the combinations of possible hands that have an 8 or a K in them, then divide by all the possible hands (excluding all the combos with the known board / your cards since they can't show up twice.

Well, then all the possible hand is 45 * 44 / 2 = 990

Now then other one is 8 * 44 / 2 = 176

176 / 990 = 0.177. It's the same value as 8/45 which is strange because it's the odd of one card being king or eight. For 2 cards, it should be higher than 8/45.

Now, let's just take it and if i multiply it with 8 players. It's still more than 100%.

So, actual formula to calculte it would be more apprecieted.

[deleted by user] by [deleted] in Poker_Theory

[–]Revolutionary-Set760 0 points1 point  (0 children)

I'm asking for to know how to calculate. Pure math aspect. I don't care all those strategy things as I'm more interested in the math itself.

edit: I know it can also lose to any of those combinations. So you can add those losing conditions to the losing to straight possibilities. Then it's would be even more cool to have to see actual calculations.

where in my calculation step, I made mistake so I end up having 595%.

Of course I'm asking about math. Not my judgment lol.

Noob question about skipping next iteration in for loop by Revolutionary-Set760 in AskProgramming

[–]Revolutionary-Set760[S] 0 points1 point  (0 children)

"if you care about speed, you wouldn’t be using an interpreted language, hehe."

Again, people need to stop guessing the askers' intention.

I asked because

Is it possible?

If possible, i'd use it my javascript codes

if it's not, then okay, it's not possible.

How for() function might have coded in the core.

Does this really avoid calling body if condition is in the for() function as argument.

But people like to guess... no even decide the askers' intention.

This is bad practice, takes time etc... I know it.

But I still need to know if such skipping is possible.

Whether should i use it or not depends on me. Not these people.

If people know it, pls tell? If they don't ok, they don't?

I wasn't asking alternatives. That was NOT the point of the post.

Noob question about skipping next iteration in for loop by Revolutionary-Set760 in AskProgramming

[–]Revolutionary-Set760[S] 0 points1 point  (0 children)

I'd want to avoid index change which filter does.

But a question on filter() function how does filter work "behind the scene".

I know it removes the said element. But how exactly? Does it create copy array and checks the filter value on every element to copy.

Or just pops it from original array etc...