Gunnar_Andersson - peregrineshahin/ChessProgrammingWiki GitHub Wiki

---

title: Gunnar Andersson

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 ...

• Gunnar Andersson, Tomas Normark (1995). Aggregation methods for large-scale location problems on networks. Master's thesis, Department of Mathematics, Royal Institute of Technology
• Gunnar Andersson, Lars Engebretsen (1997). Better Approximation Algorithms and Tighter Analysis for Set Splitting and Not-All-Equal Sat. Electronic Colloquium on Computational Complexity, Vol. 4, No. 22
• Gunnar Andersson, Lars Engebretsen (1998). Sampling Methods Applied to Dense Instances of Non-Boolean Optimization Problems. RANDOM 1998
• Gunnar Andersson, Richard L. Francis, Tomas Normark, M. Brenda Rayco (1998). Aggregation method experimentation for large-scale network location problems. Location Science, Vol. 6, Nos. 1–4
• Gunnar Andersson (1999). An Approximation Algorithm for Max p-Section. STACS 1999

2000 ...

• Gunnar Andersson (2000). Some New Randomized Approximation Algorithms. Ph.D. thesis, Department of Numerical Analysis and Computer Science, Royal Institute of Technology, advisor Viggo Kann, pdf
• Gunnar Andersson, Lars Engebretsen, Johan Håstad (2002). A New Way to Use Semidefinite Programming with Applications to Linear Equations mod p. Royal Institute of Technology, SE-100, pdf
• Gunnar Andersson, Per Bjesse, Byron Cook, Ziyad Hanna (2002). A proof engine approach to solving combinational design automation problems. DAC 2002, pdf
• Gunnar Andersson, Per Bjesse, Byron Cook, Ziyad Hanna (2003). Design automation with mixtures of proof strategies for propositional logic. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol. 22, No. 8

External Links

• Gunnar Andersson's Homepage
• Gunnar's Othello page
• Writing an Othello program
• Gunnar Andersson - The Mathematics Genealogy Project

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