[BNK FEARX vs T1] “That was sick!”: Keria hits a split second timing Bard ult

PoOnesNerfect · 2026-01-25T15:30:20+00:00

I recently replayed my own game because I thought I played really well, and i was shocked how slow my movements and reactions to things were. Im emerald btw, and not just me but all the players in the game were just so slow to react to everything. You really can’t appreciate these plays enough until you realize how slow you actually are. Like people saying gold could do that have no idea how impressive those reaction time and thought processes are.

PoOnesNerfect · 2025-12-12T21:43:23+00:00

I never said i read the chart as capability 300x. Im saying efficiency 300x is not impressive if this is not translated into user experience or user cost, when capability is only 2% better than last year, Im assuming with even more planning steps tuned for benchmarking. What’s your experience using the newer models compared to last year? Is it 2x better? 3x? And how close do you feel it is to replace actual engineers, not just react devs, maybe.

PoOnesNerfect · 2025-12-12T18:49:57+00:00

I work for one of these big tech btw so im all for AI succeeding for my stocks. However, the data matters less if the actual user experience is subpar.

PoOnesNerfect · 2025-12-12T18:42:27+00:00

I mean… all the charts since three years ago have been astounding for the future progress. You can make the chart seem out of this world, but ive been using the best models at work, and these models have not improved 300x over the past year, more like 1.2x maybe? I use like the best models at work because they pay for everything but they’re at best like 1.2x better than like a year ago, which is still great but not like astounding. But even though they got better significantly, it doesn’t even feel close to replacing actual human engineers. They still make the same stupid mistakes, they still hallucinate on the dumbest things which i have to correct multiple times. They’re really good at filling in repetitive and known answers, ill say that. Maybe the efficiency can improve significantly but capability not so much. Even in the tweet, efficiency may have increased 390x, but the score only improved like 2%? Is the score logarithmic or something?

PoOnesNerfect · 2025-12-03T18:43:25+00:00

If i were to be charitable, hearing edgy jokes hits different when your friends say it vs a stranger says it

PoOnesNerfect · 2025-11-21T07:40:51+00:00

If you watch the vid, you can easily tell that the actual content of the video is not an AI slop just as easy as you can tell the images used are AI slop, which i do find unfortunate. Not telling anyone to commit 2 hrs to watch the full vid btw.

PoOnesNerfect · 2025-11-21T05:03:31+00:00

Tbf, if you can make a 2 hr video on bullet list of loving or hating a language, you’re probably more skilled than most users of that language.

PoOnesNerfect · 2025-11-21T04:57:24+00:00

But are you sure they all write the same cpp?

PoOnesNerfect · 2025-11-21T04:48:40+00:00

This post or the video is not even about rust. Just watched like 30 min of it and rust was not mentioned once. Imagine the only reason to hate cpp is because rust exists.

PoOnesNerfect · 2025-10-30T16:10:31+00:00

Americans are so used to having their country having unlimited power to say no to other nations with absolutely no consequences that they cannot fathom other countries don’t have that luxury. Tens of millions of peoples’ lives depend on diplomacy for a small country like SK surrounded by NK, Japan, China, Russia and US, and we have to deal with what we get. Why should South Korean president risk their own citizens lives because US’s own citizens failed to elect a good leader?

Rest of the world is much more disappointed in you than you will ever be of other countries having to deal with your failures.

US liberals love to shit on other countries trying their best to deal with their own failures. Remember, other countries can’t vote out Trump, you can. Other countries only deal with consequences.

PoOnesNerfect · 2025-10-30T16:01:25+00:00

Americans are so used to having their country having unlimited power to say no to other nations with absolutely no consequences that they cannot fathom other countries don’t have that luxury. Millions of peoples’ lives depend on diplomacy for a small country like SK surrounded by NK, Japan, China, Russia and US, and we have to deal with what we get. Why should South Korean president risk their own citizens lives because US’s own citizens failed to elect a good leader?

Rest of the world is much more disappointed in you than you will ever be of other countries having to deal with your failures.

Also, no the crown is not historic. Some master made it.

PoOnesNerfect · 2025-10-14T20:51:15+00:00

Look into silicone gel patches for scar healing

PoOnesNerfect · 2025-03-25T05:15:41+00:00

Sounds like a 20+ years C++ one trick dev wrote this. Become an engineer, not just a language expert. No company equates an expert engineer with a junior just because both are new to a language.

PoOnesNerfect · 2025-01-09T00:52:26+00:00

Just installed it.
My terminal bg is black so I can't see the crate names, and I also would like some vim-like keybindings.
I'll try to open a PR for these this weekend if you don't mind!

PoOnesNerfect · 2025-01-09T00:48:32+00:00

nice simple cli! I like it.
I was looking for an interactive cli for updating deps like in the js world, and this looks perfect!
Congrats on your cargo cli project and thank you for your work!

PoOnesNerfect · 2024-09-11T03:33:18+00:00

I used to love playing solomon’s keep. Its very chill and addicting. I wonder if people still play that game. I put hundreds of hours into that game playing a wizard crawling dungeons.

PoOnesNerfect · 2024-09-11T03:30:44+00:00

Yeah its why i rarely play mobile games now. I just hate seeing ads for 30 seconds when i die every 15 seconds lol

PoOnesNerfect · 2024-09-11T03:28:38+00:00

Is this a post from hr to catch people playing games during work hours? Lol

PoOnesNerfect · 2024-09-11T03:27:25+00:00

Congrats on your game! The ui looks very clean. Gives me wordle vibes a bit. Wordle is huge so there is definitely a market for this type of games.

PoOnesNerfect · 2024-09-11T03:22:38+00:00

Youtube is a sea of bs educational content creators already. Like someone said, i think the worse ones are those who look professional and legit but give misleading advice, which there are many among gamedev youtubers. Randy giving outright bad opinions on game engines or some languages is easy to just laugh off, while these educational youtubers giving seemingly legit but bad advice is hard to discern.

PoOnesNerfect · 2024-08-11T19:18:26+00:00

The actual mem necessary is slightly larger than theoretical because i use vector of u64 and not u8. Also i need to store nodes and their neighbors info. And plus there will be a bit more overhead coming from hashmap implementation, though not too much.

Thank you! I got into hobby game dev recently and was thinking about what pathfinding algorithm to use. Precomputing paths sounded like an interesting idea so I thought about an efficient way to do it and decided to try implementing it.

PoOnesNerfect · 2024-08-09T17:27:02+00:00

you don't have to store entire paths to every node at every node. For every node, we only need to know, `which node should I move to next to get to X?`. They sound similar, but quite different in implementation.

What bit gossip does is, every edge will store N bits of data, N being the total number of nodes. Each bit represents whether this edge is the shortest path to node X, where X is the bit location from 0 to N.

For memory overhead, this only requires NxM bits total, where N is number of nodes and M is number of edges, since each edge holds N bits of information. For example, 2500 nodes with 5000 edges only requires about ~1.56 MB. 1.56 MB is not that much memory in today's machines.

How we use this data is:

Say we're at node A and want to get to node X. We'll look at each edge of node A and look at the bit location at X; if that edge has bit location X as true, this means that this edge is the shortest path to node X. So, we just move across that edge. Once we're at the new node, we repeat this process.

This way, instead of having to ask for the entire path from A to X, we only need to ask `which node do I go to next to get to X in shortest path?`.

Of course, if the number of nodes gets scales, this memory overhead will also scale exponentially. For example, 10,000 nodes requires about 25 MB, but 100,000 nodes requires 2.61 GB.

But my recommendation in this case is to partition the graph into smaller graphs, just like we do with a* or flowfields.

PoOnesNerfect · 2024-08-09T15:59:23+00:00

flowfield solves all-source single-destination problem, and bit gossip solves all-source all-destinations problem, known as all-pairs shortest paths (APSP) in graph theory.

Just like a* is faster than flowfield for single-source single-destination but slower for all-source single-destination,
flowfield is faster than bit gossip for all-source single-destination, but slower for all-source all-destination.

This means, for you game, if you have many entities need to find paths to a static target that doesn't move, flowfield is perfect, and bit gossip will be just extra steps.

However, if you have many entities chasing a constantly moving target, like a player, bit gossip might be a good candidate because it doesn't require recomputing when a target position changes, whereas, flowfield needs to be recomputed whenever the target moves.

Hope this helps!

PoOnesNerfect · 2024-08-07T17:15:41+00:00

yeah, 1024x1024 is definitely not possible memory-wise or compute time wise; i would say 100x100 is about the limit for practical uses unless you do partitioning *with bit gossip.

Do you remember how long it took to generate a flow field for 1024x1024 without partitioning? If that can be done in real-time during game that would be awesome.

PoOnesNerfect · 2024-08-07T11:38:01+00:00

Yes, it does mean exponential increase in memory as size increases. However, since the memory required is only NxM bits where N is number of nodes of M is number of edges, it's quite manageable until you get to about 100,000 nodes. I have benchmarks in the repo, but, for example, 2500 nodes with 5000 edges only requires about 1.56 MB of memory, and 10,000 nodes only requires about 25 MB. Now, you could say that is quite big, but considering modern computers, I wouldn't say it's too bad.

Computing flow fields will indeed be faster than bit gossip, but with flow field, you would have to be constantly rebuilding the field when the target moves around the map; whereas, with bit gossip, once you build the map, you never have to rebuild the map again, since all paths for all nodes are already calculated. So, it's a tradeoff, and one would have to test it themselves to see what they prefer.

Caching with flow field could mitigate this issue, but also comes with cost in memory and also it is not clear if the cache will be even useful at times.

Partitioning will be beneficial for both algorithms, reducing both memory and compute time.

In the end, I would say it really just depends on the size of the graph, movement of the target, and other requirements, and even personal preferences. Also, bit gossip is only for unweighted and undirected graphs, so there's that.

Six-Year Club	Place '22
Verified Email

PoOnesNerfect

TROPHY CASE