Gunnar Andersson

From Chessprogramming wiki
Jump to: navigation, search

Home * People * Gunnar Andersson

Gunnar Andersson,
a Swedish computer scientist and mathematician, Ph.D. from Royal Institute of Technology in 2000 under Viggo Kann on the topic of approximation algorithms for optimization versions of NP-complete decision problems [1] . As Othello programmer, Gunnar Andersson is primary author of the strong Othello program Zebra [2] and its Windows freeware incarnation WZebra [3], already incorporating advanced bitboard techniques like Kogge-Stone Algorithm. An older 2003 MMX implementation of Dumb7Fill in inline assembly was used to determine mobility [4], while the implementation by co-author Toshihiko Okuhara in Zebra looks parallel prefixed [5].

Selected Publications

[6] [7]

1995 ...

2000 ...

External Links

References

  1. Gunnar Andersson (2000). Some New Randomized Approximation Algorithms. Ph.D. thesis, Department of Numerical Analysis and Computer Science, Royal Institute of Technology, pdf
  2. Zebra
  3. Download WZebra
  4. bitboard mobility Copyright (c) 2003, Gunnar Andersson
  5. bitbmob.c in zebra.tar.gz
  6. Gunnar Andersson, Research
  7. dblp: Gunnar Andersson

Up one level