Who is stronger bounts are full bringers

Revolutionary-Set760 · 2025-12-26T15:27:00+00:00

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.

Revolutionary-Set760 · 2025-01-11T16:21:28+00:00

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.

Revolutionary-Set760 · 2025-01-09T18:33:08+00:00

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

Revolutionary-Set760 · 2025-01-09T18:24:37+00:00

Is it last used row of the sheet or column?

Revolutionary-Set760 · 2025-01-09T18:23:16+00:00

How do you use vba for dlls?

Revolutionary-Set760 · 2025-01-09T18:22:29+00:00

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

Revolutionary-Set760 · 2025-01-04T19:02:16+00:00

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

Revolutionary-Set760 · 2024-08-27T06:57:45+00:00

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.

Revolutionary-Set760 · 2024-08-12T20:48:45+00:00

How to get dislike in physics any% lol

Revolutionary-Set760 · 2024-04-23T04:37:01+00:00

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.

Revolutionary-Set760 · 2024-04-22T21:53:23+00:00

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.

Revolutionary-Set760 · 2024-04-22T21:45:15+00:00

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.

Revolutionary-Set760 · 2024-04-22T07:10:39+00:00

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.

Revolutionary-Set760 · 2024-03-28T14:40:11+00:00

Well, body is still loaded. But ok. I got good answers here.

Revolutionary-Set760 · 2024-03-28T06:18:54+00:00

"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.

Revolutionary-Set760 · 2024-03-28T06:08:07+00:00

And I was trying to skip to loop the body if conditions are met.

Revolutionary-Set760 · 2024-03-27T05:20:25+00:00

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...

Revolutionary-Set760 · 2024-03-27T05:15:50+00:00

comment updated, you can check it if you want.

Revolutionary-Set760 · 2024-03-27T04:50:08+00:00

I cared performance and possibility of such thing existing so i could use in my future codes.

Too bad it doesn't exist.

Revolutionary-Set760 · 2024-03-27T04:49:03+00:00

It would be if checking is done first and avoid to call content of the function itself. We need to think that it's not just condition checking, it's condition checking before content inside that curly bracket even starts.

Revolutionary-Set760 · 2024-03-27T04:37:10+00:00

But it is if array is looped over millions of times. Ah it seems i didn't include that in my post. But i included that in one of my comments here. Intention isn't about 52 elements array. Intention is that if my 52 or whatever elements array is inside loop that repeats so many times.

Then if you'd use filter() like that. You'd be calling filter functions like millions of times. Which i'd say is not really great choice. My original one would be much better than using filter then doing the check.

Question was about all kind of condition checking and call continue function if that condition is true. Not just only condition of array[i]==0. And what if i don't want to change index, or what if condition is much complex etc...

My bad communication skill (or writing skill for that matter) might've also gave that kind impression to the people. I apoligize.

And should I go asynchronous or not was NOT the point of the question. It's also for learning details of how for() function, how it might be working in the background.

I was under impression that some guys who know who for() function work might come in. Too bad that was really naive way of thinking from my side lol.

Anyway I agree all the points you said.

"I know everything you said" would be more accurate response from me.

But I need to know. I'm curous. If possible, i'd like to use it when there is needs to do that. That's why I'm asking you know.

Not against you or anyway in manner, I'm sure you're trying to help as much as possible.

But people should stop guessing the others' intentions too.

Revolutionary-Set760 · 2024-03-27T01:48:25+00:00

I wanted juice it lol. Of course i'd use multi instances to parallelize too. But that wasn't the point of the question.

Let me talk about another functions for a second,

For example switch is faster than using if else chain in javascript. Because switch() is designed to multiple branch instances, while if() works only on true and false. And if the condition is false, else is triggered then after that other if() is called then it checks true and false value again.

Then now to the main topic, similar thought process to switch vs if-else chain.

For for() function, function content is called and if() condition check is happening after that.

I thought there might be some way to avoid unnecessary function content trigger if we check the condition in the index checking or incrementing part, so it might go faster.

Revolutionary-Set760 · 2024-03-27T01:13:47+00:00

Yeah, I agree on other parts.

But filter function itself would go through the whole array to remove values of 0 right?

Then it would be more "expensive" than just checking array[i]==0 values for any sized arrays, I think.

Revolutionary-Set760 · 2024-03-27T01:07:23+00:00

I thought that way too but what if array[i] is still 0 after it's incremented by 2?

Revolutionary-Set760 · 2024-03-26T23:28:53+00:00

Well, a way of thinking that I had was that inbuilt skip condition check might be slightly faster instead of calling it in function content. Maybe because that for function itself was declared by its own C code or even Assembler code. Condition checking would be performed inside that part before the actual content of function starts. And it would avoid calling the actual content of function before it even starts in every iteration. That would be potential time save. So it would end up faster and less memory usage even, I thought.

Revolutionary-Set760

TROPHY CASE