...position, the low 14 bits of the hash-key are used to index the table and bump up its value by one. The value is restored after unmaking the move. When en
* [[Daniel Andersson]] ('''2009'''). ''Perfect-Information Games with Cycles''. Ph.D.
34 KB (4,898 words) - 12:51, 21 August 2022
| [[Arend Bayer]], [[Daniel Bump]],<br/>[[Gunnar Farnebäck]], [[Heikki Levanto]],<br/>[[Paul Pogonyshev]],
| [[Arend Bayer]], [[Daniel Bump]], <br/>[[Gunnar Farnebäck]], [[Heikki Levanto]],<br/>[[Paul Pogonyshev]],
24 KB (2,920 words) - 22:49, 5 August 2020
| [[Arend Bayer]], [[Daniel Bump]],<br/>[[Gunnar Farnebäck]], [[Heikki Levanto]],<br/>[[Paul Pogonyshev]],
22 KB (2,665 words) - 22:50, 5 August 2020
