News for hackers. Stuff that matters.

secdeal

Generally I would recommend Vallejo or Army Painter paints over GW ones. They are cheaper, better quality coming with a much better bottle.
Re:The Impact of Jungle Music in 90s Video Game Development on Thursday November 14, 2024 @08:10AM (#42135846)
In Street Fighter 3rd Strike (1999) Akuma's stage music titled Killing Moon is one my favorites, I still listen to it
in Scala the idiomatic way to sum is the method sum on collections List(1,2,3,4).sum

Although this is indeed implemented with reduce. But is it really too much code? List(1,2,3).reduce(_ + _)

Re:Parse, Don't Validate (2019) on Tuesday March 07, 2023 @02:38PM (#35060098)
Not quite, 'a' is the type of the elements 'NonEmpty a' contains.

It is rather the subclass of some kind of 'Iterable a'.

well, match making in team games is an extremely finicky beast
That doesn't make sense, in modern match making systems you see your rank and/or rating points, you get higher, perfectly fine feedback. No one convinces themselves that they are great when they are can see that they are in the bottom division..
> Now what I'm really curious about is why [...] a simple 59-line example, is using unsafePerformIO

It seems to me that they are using the physics engine Chipmunk2D for that Animation which has bindings with IO in their signature.

Re:Case against OOP is understated, not overstated (2020) on Friday February 11, 2022 @05:23AM (#30299642)
I read about this a while ago, I'm not an expert but this is my take on it: In homotopy type theory an equivalence of types is a first class value that you can manipulate. And also you can separate types from their 'implementations'. Classic example is you have a Nat type, with a Peano construction (Nat is a zero or a successor of a Nat.) This is not very efficient, but you write functions with it, prove things etc. It's time to optimize, and you change your Nat implementation to something more efficient (e.g. a Nat is Zero, or twice a Nat, or twice a Nat + 1). Your functions and proofs that you wrote with the previous implementation still will work and your type signatures won't have to change
Re:The Math of Card Shuffling (2018) on Thursday August 06, 2020 @02:30PM (#24073962)
With practice you can get a riffle under 2-3 seconds without weaving. But if 7 still seems too much, do less but do a running cut or overhand shuffle between two of the riffles, like riffle -> riffle -> running cut -> riffle -> offer to cut -> deal. I heard this is what casinos did in older times, and they do have a direct interest in not making the shuffling too long (less hands played) or too weak (can be abused).
Re:The Math of Card Shuffling (2018) on Thursday August 06, 2020 @02:01PM (#24073660)
Most smarter magicians think that it is a waste to show off things like this as demonstrations. There is a number of extremely clever card tricks that use the principle mentioned by you as one of their components, but you won't notice. It can be hidden in clever ways.