livetalk
@livetalk.bsky.social
Just here in case the ship sinks ig
Are you just sampling the spline once? Or do you happen to know a previous position that is close by?
January 20, 2026 at 4:48 PM
Are you just sampling the spline once? Or do you happen to know a previous position that is close by?
Generally, the the first paragraph looks pretty O(log n) to me.
You can maybe improve the real-world performance with some assumptions or problem knowledge. But O(1) seems kind of unlikely with a search approach.
You can maybe improve the real-world performance with some assumptions or problem knowledge. But O(1) seems kind of unlikely with a search approach.
January 19, 2026 at 11:12 PM
Generally, the the first paragraph looks pretty O(log n) to me.
You can maybe improve the real-world performance with some assumptions or problem knowledge. But O(1) seems kind of unlikely with a search approach.
You can maybe improve the real-world performance with some assumptions or problem knowledge. But O(1) seems kind of unlikely with a search approach.
I named a variable 'o' and I repeatedly typed '0' (zero) instead :')
It's not even a valid name
It's not even a valid name
January 17, 2026 at 11:34 PM
I named a variable 'o' and I repeatedly typed '0' (zero) instead :')
It's not even a valid name
It's not even a valid name
It should have performance similar to an else-if chain
January 15, 2026 at 6:46 PM
It should have performance similar to an else-if chain
The last fight with Widow was super impressive :o
January 10, 2026 at 2:57 AM
The last fight with Widow was super impressive :o
"I haven't closed unity yet without crashing" ..? I had to read that twice
January 6, 2026 at 8:45 PM
"I haven't closed unity yet without crashing" ..? I had to read that twice
I joined during the vacuum session. Was just what I needed while coding :D
January 5, 2026 at 2:52 PM
I joined during the vacuum session. Was just what I needed while coding :D
From watching the beginning, I feel input calibration would solve this.
The bigger horizontal margins are only needed because players hit different angles on different hardware. And then it's no wonder the downwards movements are whiffed, as the zones are so small they force a precise base switch.
The bigger horizontal margins are only needed because players hit different angles on different hardware. And then it's no wonder the downwards movements are whiffed, as the zones are so small they force a precise base switch.
December 15, 2025 at 3:01 AM
From watching the beginning, I feel input calibration would solve this.
The bigger horizontal margins are only needed because players hit different angles on different hardware. And then it's no wonder the downwards movements are whiffed, as the zones are so small they force a precise base switch.
The bigger horizontal margins are only needed because players hit different angles on different hardware. And then it's no wonder the downwards movements are whiffed, as the zones are so small they force a precise base switch.
I didn't know that's where the interface is located...
December 6, 2025 at 10:44 PM
I didn't know that's where the interface is located...
ok fine but pre-computing it or iterating isn't any fun I'm trying to solve math puzzles here!
November 17, 2025 at 1:10 AM
i=0
c=0
loop:
c += 3*(n-2*i)
if (x < c) return i
i++
This is the version that I started out with, that works for uneven cases like x=5. The idea is to iteratively add the number of nodes in each shell and check if the index has been reached yet. Then return the counter of the current shell.
c=0
loop:
c += 3*(n-2*i)
if (x < c) return i
i++
This is the version that I started out with, that works for uneven cases like x=5. The idea is to iteratively add the number of nodes in each shell and check if the index has been reached yet. Then return the counter of the current shell.
November 17, 2025 at 1:08 AM
i=0
c=0
loop:
c += 3*(n-2*i)
if (x < c) return i
i++
This is the version that I started out with, that works for uneven cases like x=5. The idea is to iteratively add the number of nodes in each shell and check if the index has been reached yet. Then return the counter of the current shell.
c=0
loop:
c += 3*(n-2*i)
if (x < c) return i
i++
This is the version that I started out with, that works for uneven cases like x=5. The idea is to iteratively add the number of nodes in each shell and check if the index has been reached yet. Then return the counter of the current shell.
I can think of an iterative way:
i=0
c=0
loop:
inc = 3*(n-2*i)
if (inc == 0):
c += 1
if (x < c) return i
return "x out of bounds"
c += inc
if (x < c) return i
i++
The special case handling is making the loop more ugly ;-;
i=0
c=0
loop:
inc = 3*(n-2*i)
if (inc == 0):
c += 1
if (x < c) return i
return "x out of bounds"
c += inc
if (x < c) return i
i++
The special case handling is making the loop more ugly ;-;
November 17, 2025 at 1:04 AM
I can think of an iterative way:
i=0
c=0
loop:
inc = 3*(n-2*i)
if (inc == 0):
c += 1
if (x < c) return i
return "x out of bounds"
c += inc
if (x < c) return i
i++
The special case handling is making the loop more ugly ;-;
i=0
c=0
loop:
inc = 3*(n-2*i)
if (inc == 0):
c += 1
if (x < c) return i
return "x out of bounds"
c += inc
if (x < c) return i
i++
The special case handling is making the loop more ugly ;-;
Huh, that's cool! Feels like a decent overlap with C funnily enough. People there also like to allocate stuff on the stack and there are 'advanced' memory management techniques to minimize the number of individual heap allocations^^
(I only call them advanced because beginners usually dont use them)
(I only call them advanced because beginners usually dont use them)
November 13, 2025 at 4:54 PM
Huh, that's cool! Feels like a decent overlap with C funnily enough. People there also like to allocate stuff on the stack and there are 'advanced' memory management techniques to minimize the number of individual heap allocations^^
(I only call them advanced because beginners usually dont use them)
(I only call them advanced because beginners usually dont use them)
Suddenly the cloud looked like a cat :c
November 1, 2025 at 1:20 PM
Suddenly the cloud looked like a cat :c
Well, I also got the problem itself wrong, so... :P
October 30, 2025 at 10:14 PM
Well, I also got the problem itself wrong, so... :P
Damn, now this website is trying to nerd-snipe me into solving physics equations
spiff.rit.edu/classes/phys...
spiff.rit.edu/classes/phys...
October 29, 2025 at 7:43 PM
Damn, now this website is trying to nerd-snipe me into solving physics equations
spiff.rit.edu/classes/phys...
spiff.rit.edu/classes/phys...
The thought that got me here: the shortest path out of a unit cube is aligned with an axis and that cuts the cube effectively into 6 volumes (pyramids)
October 29, 2025 at 7:39 PM
The thought that got me here: the shortest path out of a unit cube is aligned with an axis and that cuts the cube effectively into 6 volumes (pyramids)
I think this problem can be reduced to looking at 6 pyramids. For the average, looking at one pyramid is enough. Then whatever the average distance of each point in the pyramid to the bottom is.
My wild guess is 1/3, since I remember that number was relevant in pyramids, but dunno c:
My wild guess is 1/3, since I remember that number was relevant in pyramids, but dunno c:
October 29, 2025 at 7:36 PM
I think this problem can be reduced to looking at 6 pyramids. For the average, looking at one pyramid is enough. Then whatever the average distance of each point in the pyramid to the bottom is.
My wild guess is 1/3, since I remember that number was relevant in pyramids, but dunno c:
My wild guess is 1/3, since I remember that number was relevant in pyramids, but dunno c:
I've noticed that kind of pattern in people as well. Sometimes a bit shocking what it says about them.
October 28, 2025 at 11:06 PM
I've noticed that kind of pattern in people as well. Sometimes a bit shocking what it says about them.
And what is there to progress? Software merely configures hardware to do the right computation.
The only areas of improvement I can think of:
- tools to make software cheaper/'safer'
- mapping the algorithm to hardware as efficiently as possible
- changing the algorithm (as in your routing example)
The only areas of improvement I can think of:
- tools to make software cheaper/'safer'
- mapping the algorithm to hardware as efficiently as possible
- changing the algorithm (as in your routing example)
September 26, 2025 at 10:29 PM
And what is there to progress? Software merely configures hardware to do the right computation.
The only areas of improvement I can think of:
- tools to make software cheaper/'safer'
- mapping the algorithm to hardware as efficiently as possible
- changing the algorithm (as in your routing example)
The only areas of improvement I can think of:
- tools to make software cheaper/'safer'
- mapping the algorithm to hardware as efficiently as possible
- changing the algorithm (as in your routing example)
"We've got to do something about software. One of the big cries today is that software cost too much and you can't maintain it." (Part 2, at 15 Minutes)
I see that hasn't changed in 43 years.
I see that hasn't changed in 43 years.
September 20, 2025 at 12:50 PM
"We've got to do something about software. One of the big cries today is that software cost too much and you can't maintain it." (Part 2, at 15 Minutes)
I see that hasn't changed in 43 years.
I see that hasn't changed in 43 years.
That just made me think of exposure time. Which according to Wikipedia is the same thing.
September 14, 2025 at 4:20 PM
That just made me think of exposure time. Which according to Wikipedia is the same thing.
c'est le wrong video :/
September 2, 2025 at 7:52 PM
c'est le wrong video :/
It's not even design. It's just convention :D
Afaik Lua arrays are actually dictionaries and it doesn't care if you use 0 or 1 as the first index.
www.lua.org/pil/11.1.html
Afaik Lua arrays are actually dictionaries and it doesn't care if you use 0 or 1 as the first index.
www.lua.org/pil/11.1.html
Programming in Lua : 11.1
www.lua.org
August 24, 2025 at 8:31 AM
It's not even design. It's just convention :D
Afaik Lua arrays are actually dictionaries and it doesn't care if you use 0 or 1 as the first index.
www.lua.org/pil/11.1.html
Afaik Lua arrays are actually dictionaries and it doesn't care if you use 0 or 1 as the first index.
www.lua.org/pil/11.1.html