Detector for when you abandon poor little Desmos
Link: https://www.desmos.com/calculator/kyeelfo51p
How could you leave Desmos alone like that? >:(
Link: https://www.desmos.com/calculator/kyeelfo51p
How could you leave Desmos alone like that? >:(
Link: https://www.desmos.com/calculator/nxa7dk1b6c
Just a cool 3D illusion with polygons.
Link: https://www.desmos.com/calculator/inwpcsd0vn
Just a basic pong game. Comes with options for difficulty. Hitting the ball with some speed will increase the ball's velocity.
Link: https://www.desmos.com/calculator/m6obg8x77b
I just think they're neat
I want to remove the preceding signs and separators for Location and Function designations, but it seems EPLAN isn't letting me change anything in those boxes. When I highlight the equals sign next to Function designation, nothing I do changes the equals sign to something else.
Link: https://www.desmos.com/calculator/mgcd67vtmg
This is a demo version of a larger game I'm making.
Rules:
Move the x-shaped character around the map to activate all 11 switches. Once complete, a final switch will light up on the back of the warden. Hitting the switch will kill the warden and win the game! Make sure the draggable point is within direct line-of-sight to the x-shaped character or else it won't move.
I plan on adding more levels along with powerups and puzzles in the future. Feel free to comment any unique ideas you may have that I should add, or ways I could improve the game.
Pro-tip when using a mouse:
To make things easier for control, left-click and hold the draggable point, then right-click once (which opens the options window next to the mouse), then release the left-click button. Move your mouse somewhere off that window and scroll once. This will give full control over the draggable point without constantly needing to hold the left-click button.
Link: https://www.desmos.com/calculator/dcnjjxnunc
A collision detector to see if a point is inside a polygon. Will work with any polygon with any number of sides as long as it's not self-intersecting.
Basically all it's doing is calculating the overall area of the polygon. If the player's point was added to one of the polygon's sides, the area should either grow or shrink. If the area shrinks, then the point must be inside the polygon.
Here's a link which better shows what I mean: https://www.desmos.com/calculator/ltktsq95pp
Not sure if this is the most efficient method, but performance seems very steady even with a 100-side polygon. Performance does seem to start slowing down after 200 sides.
Link: https://www.desmos.com/calculator/ka5yfejfhs
(for self-intersecting shapes) Link: https://www.desmos.com/calculator/sot7xmdszl
(thanks to anonymous-desmos)
Been working on a larger project for finding the probability of a random n-sided polygon being convex. It got very tedious making a new function every time I added another side to a polygon, so I made a general function for any n-sided polygon.
I was originally inspired by this video: https://youtu.be/kSYvLFoIlQI?si=KLTTMHR0ucJtnntq
I was inspired by this post's question: Why the titans stopped instantly in the finale?
The question was raised about why Eren's control over the titans stayed for longer after physical contact ended with Dina than with Zeke.
My theory is that Eren's control over the titans ended not when physical contact is severed, but when the person (or rather a titan) with royal blood died. With Dina, it ended when her nape was fully eaten. With Zeke, it ended when Levi killed him.
Because in Paths, distance plays no factor to how the Founder's powers work, it makes some sense that once a link is made between the Founding Titan and a titan with royal blood, that link stays until one side of the link is broken. Either the host of the Founder dies, or the host of royal blood dies.
If King Fritz truly desired to stop violence with titans, why didn't he forcefully take the other 8 titans into the walls and trap them in a crystal or something? Even if a crystal wouldn't work to perfectly restrict the 8 titans, the king can just eat them all so that he can pass on all 8 titans at once within the Reiss family.
This would completely stop any outside nation from causing more violence with titans... just like the King would want, right?
The only reason I can think is the king needed pure titans to always be around on Paradis to stop Eldians from desiring to escape the walls.
But an easy solution is to only bring 7 of the titans into the walls and leave the Tybers with the Warhammer. This way, Marley would always have access to titan serum, and the Tybers will never directly use the Warhammer for war (ironically) because that's how the Tybers always felt. Even if Marley used some pure titans to commit violence on neighboring nations, it's definitely a lot less violence than what we see when they have 7 titans under their control.
Do the wall titans have short feet so they wouldn't stick out of the walls?
It kinda makes sense because the Colossal Titan's feet aren't as short as the wall titans' feet.
I swear I haven't been staring at feet for hours.
This post contains content not supported on old Reddit. Click here to view the full post
General Relativity describes that as objects approach a black hole, their clocks slow down (relative to an outside observer's clock). This includes the velocity of objects. From an outside observer's perspective, the object can never cross the event horizon because its velocity will approach 0 as it approaches the event horizon, thus never actually adding mass inside the black hole.
The paradox is how can a black hole form in the first place? How can particles get close enough to first form the event horizon (observable to outsiders) if they slow down to 0 velocity as they approach each other?
Shouldn't it take infinite time for particles to get close enough to finally create a black hole?
EDIT:
Seems like a lot of people think I'm purely talking about hand-to-hand combat. I'm mainly focused on why Frieda didn't alter Grisha's memories with screaming.
Original post:
Frieda, despite having the Founding Titan, lost to Grisha. Rod Reiss says this was because Frieda lacked experience with her titan, and so lost to Grisha who had a physically stronger titan. At face value, this makes sense.
However, the Warhammer Titan - despite lacking battle experience as explained by Galliard - was incredibly amazing at fighting.
The Warhammer being good at fighting makes sense because titan shifters inherit the memories of previous shifters. This means they should also inherit the battle experience of previous shifters (similar to Ackermans), which would explain why the Warhammer Titan was so good at fighting despite never being involved in a battle alongside Marley's military.
However, this should also apply to Frieda. She should inherit the memories of previous Founding Titans, and therefore already know how to use her powers to stop Grisha. Because the vow to renounce war caused Frieda to inherit the ideology of Karl Fritz, you'd expect it to also give her direct knowledge of how to use her Founding Titan abilities. But for some reason, this wasn't the case.
So this seems like a plot hole. The Warhammer was incredible at fighting despite lacking direct battle experience. So Frieda should have been much better at using her Founding Titan's powers.
Link: Lucky 7 Shuffles | Desmos
Randomly shuffling only 7 times actually sorted my list! How lucky is that? :D
Link: https://www.desmos.com/calculator/6iebyyrpib
A random shuffle sorted my list! :D
best wig I could be wrong about, but otherwise everything else is just facts
Link: https://www.desmos.com/calculator/z7bxe7uz11
I just want x_0 to be defined once (at the top). Is there a workaround or way to avoid this?
2x2 Clusters Link: https://www.desmos.com/calculator/b8vwyvwlp7
3x3 Clusters Link: https://www.desmos.com/calculator/a51wcew4h3
original reddit post: Conway's Game of Life (boundless) : r/desmos
I've been playing around with a method of optimization for Conway's Game of Life. It works by grouping a cluster of cells into a single numerical value. For a group of 2x2, it groups 4 cells into a binary number (up to 15). For a group of 3x3, it groups 9 cells into a binary number (up to 511).
This binary numerical value can be broken down into its individual bits, and by using those bits we can determine which cells are alive/dead within that cluster.
I've considered making a graph which uses 4x4 clusters, but I'm honestly not sure if there would be any noticeable improvement in performance. Going from 2x2 to 3x3 wasn't as big of a jump in performance as was going from 1x1 to 2x2.