Timeline for Efficient way to encode moves and container choice for chess moves for an engine
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 22, 2020 at 5:05 | comment | added | user374476 | @DemonCode We'll I didn't go with the 16-bit solution, I didn't see any clear advantage. I went for a struct | |
| Oct 22, 2020 at 2:21 | comment | added | user377672 | 16-bit move solution sounds really tight to me but with more processing required, and it wouldn't let you jump back and forth at random points in the move history without processing all the individual moves. If that latter one is a common case, I really like Kain0_0's 256-bit solution which represents the entire board. | |
| Sep 9, 2020 at 15:30 | vote | accept | CommunityBot | ||
| Sep 9, 2020 at 13:58 | answer | added | Doc Brown | timeline score: 3 | |
| Sep 9, 2020 at 7:13 | answer | added | Kain0_0 | timeline score: 2 | |
| Sep 9, 2020 at 7:12 | comment | added | gnasher729 | Oh really. What can it do that a uint64_t cannot do? | |
| Sep 9, 2020 at 7:11 | answer | added | gnasher729 | timeline score: 1 | |
| Sep 9, 2020 at 7:06 | comment | added | gnasher729 | Why are you using a library for a 64 bit number? Use uint64_t. Then measure the difference in time. | |
| Sep 9, 2020 at 6:40 | review | First posts | |||
| Sep 11, 2020 at 6:29 | |||||
| Sep 9, 2020 at 6:36 | history | asked | user374476 | CC BY-SA 4.0 |