Aryan Naraghi
where else to find them
no profile links on file
what they talk about
where they keep going back
no series more than once — all 1 in the filters
on a stage with
never shared a talk
who talks about the same things
one talk is not yet a subject
| title | conference | date |
|---|---|---|
| Optimizing Bishop, Rook, and Queen Move Generation in a Chess Engine | C++Now 2026 | 2026-05-04 |
Claim: sliding-piece generation drops from ~20+ ns to ~1 ns by using magic bitboards implemented in software as a portable alternative to PEXT. Implementation… | ||
| nothing matches | ||