News for hackers. Stuff that matters.

A comment on Magic Bitboards: Finding all valid bishop moves in a 64-bit multiply (2008). Parent comment

Re:Magic Bitboards: Finding all valid bishop moves in a 64-b... by gowld on Tuesday April 17, 2018 @07:40PM (#16863314)
Computers used to be 32bit, 16bit, 8bit...
[ Parent | on HN ]
Re:Magic Bitboards: Finding all valid bishop moves in a 64-b... by eutectic on Wednesday April 18, 2018 @03:47PM (#16870484)
But 64-bit is enough to represent essentially any value you might care to manipulate numerically, with rare exceptions such as cryptography. Given the constraints and trade-offs of real world computing, I suspect 128-bit will never become the norm.
[ Parent | on HN ]
Re:Magic Bitboards: Finding all valid bishop moves in a 64-b... by dragontamer on Thursday April 19, 2018 @03:23PM (#16879198)
You might want to look into AVX-512.

Yeah, 512-bits / SIMD computations. If chessboards were bigger, then we'd probably just use the SIMD registers. 128-bit SSE is quite common, and 256-bit AVX has been around for ~5 years now.

[ Parent | on HN ]
Re:Magic Bitboards: Finding all valid bishop moves in a 64-b... by perl4ever on Tuesday April 17, 2018 @08:23PM (#16863583)
Computers used to have 6 bit bytes and 36 bit words...I don't have my mom's IBM 704 manual anymore though.
[ Parent | on HN ]