HN user

obrhubr

83 karma
Posts5
Comments26
View on HN

Initially I didn't realise historical data was available for free... I was also interested in learning more about the system itself, writing a diy decoder, etc... which is why I bought one. But yeah, kind of lost track of explaining that in the post :)

Your monitor and your browser 100% affect the appearance. After calibrating your monitor, try opening the image in full resolution and take a few steps back.

For me, viewing the images on my phone makes them look off.

Thank you for pointing that out. The Atkinson dithering I was using was indeed messing with the results. I'll be updating the post shortly :)

I’ll try them as soon as I get the chance, I have perceptual luminance implemented already. I’ll compare :)

I am weighting each of the channels according to the formula in my post.

I’ll try OKLab and compare, thanks for the comment :)

You’re right it kind of isn’t finished… I had it done, then had an exchange with the author of didder and I’m still in the process of rewriting :)

Thanks for your comment! I'm glad you're seeing the same thing :) I re-implemented the linearised dithering in python and got similar results. I checked and rechecked the colour profiles in GIMP, nothing... At this point I can only hope for an expert to appear and tell me what exactly I am doing wrong.

This is highly specific to C# which was the language imposed on all participants. But I agree that some languages might be especially adept to these kinds of tasks and it would be interesting to see which.

The game’s implementation itself was furnished with the competition by Sebastian Lague. I completely agree that writing the move logic, validation, etc… is a difficult undertaking especially when it comes to optimisation which is what allows the bots built on top to perform well.

Thanks for linking the image. You're right in my simulation there is almost no growth, even at a high count and if you're forced to bet every round you would certainly lose money. But it's a simplistic simulation and a real casino offers slightly better odds if the rules are right.

Thanks for the feedback, appreciate it :)

Also thank you for the insight on RSA functionality, that makes a lot of sense! I didn't realise why hashing is used.

The issue with generating a valid string is, as detailed at the very end of the post, that you need at least a pipes before and b pipes after the digits which need to be between to pipes. That narrows the possibilities down quite a bit.

Thanks for the feedback, appreciate it. I wanted this to more entertaining than informative, but I understand why this might mislead.

- I agree that the section on pkcs#1 is at this point irrelevant, I left it in just to mention that fact. But I will probably take it out now :)

- Concerning the part of misusing RSA: My understanding is that you usually append the signature at the end, after a copy of the data which is not done here. I believe they are misusing it here because no library for RSA supports this use case, to decrypt using a public key you always have to provide the message and signature. This isn't possible here because the message is encrypted. So I think they are misusing RSA.

[dead] 3 years ago

Hey HN,

I am a dev from Austria and participated in the recent chess bot competition started by Sebastian Lague. I wrote this short article to summarise what I learned and I hope you enjoy it!