leothetechguy's comments

leothetechguy | 1 month ago

The slop sickens me. If deep down there still is a part of you that enjoys problem solving and creativity, then you should always do it yourself. The technology still isn't even that great.

I wanted to write a simple midi chord controller for my phone to make music, emphasis on simple. AI can't do it and couldn't even help me on small code fragments, because it doesn't look at the problem through the lens of my artistic creativity.

Vibe coding creates weak men because you reject the deeper meaning behind what you are creating. Vibe coding creates weak men because they can't code.

leothetechguy | 2 months ago | on: I got paid minimum wage to solve an impossible problem

Step 1 in this situatoon is to try and see if this is a known mathematically unsolved problem, and if it is, giving up.

Isn't this just trying to find a hamiltonian cycle, isn't this NP hard? That's when I would give up, especially because you put so many constraints in it to make it human walkable.

Edit: Of course you don't have to give up, but it's good to know what you get yourself into

leothetechguy | 2 months ago | on: How to store a chess position in 26 bytes (2022)

I remember asking myself this question years ago, and came to 162 bits. I was just a kid back then so the logic is probably wrong but I do wonder how simple the encoding could be under those constraints...

Edit: Here are the Notes

0 Empty

10 Pawn

1100 Knight

1101 Rook

1110 Bishop

1111 Queen

32 + 32 + 472

2 times 6 bits: position of the kings

30 bits: color mask

120 + 2*6 + 30 = 162 bits

We can store the rest using the methods from the blog post and add 18 bits for promotion, giving 180 bits.

I'm sure this isn't the most efficient way, and I think I had other methods and considered things like the bishops being able to occupy 32 squares, though special casing doesn't make sense because of promotions.

Technically if you got 8 bishops/queens/knights/rooks You would occupy another 16 bits, giving 196 bits

I think the upper limit can be reduced at the cost of increasing the lower limit

EDIT2: I think I made the assumption at the time that to promote one piece you needed to capture at least one enemy pawn, giving the space for the two bits, which means the upper bound is actually 180 bits

Would love to see other people try in the comment section

leothetechguy | 2 months ago | on: The State of AI Coding Report 2025

I couldn't in good conscience work like that, I believe the risk of bad AI generated code due to the tiniest of output variation is far too high. Especially in systems that need to maintain a large state governed by many rules and edge cases.

leothetechguy | 4 months ago | on: Contributing to open-source should be required, like jury duty

I remember a few open source projects struggling with hundreds of merge request of people simply adding their name to the README because they want to add "open-source" contributor to their resume as part of some bootcamp.

Any mandatory service will result in at worst malicious compliance and at best in low quality work. And I'd rather take quality over quantity.

leothetechguy | 8 months ago | on: Radium Music Editor

On linux it's very stable, on windows slightly less, but only in edge cases when stacking a big number of effects. Haven't used it on mac though, I think it either was or still is in beta on that platform. I was also unhappy about instability in the beginning, but it magically became better after regularly using it.
page 1