Home * People * Urban Koistinen

Urban Koistinen,
a Swedish mathematician and computer scientist. While affiliated with the Royal Institute of Technology in Stockholm, he was quite active in computer chess programming ^[1], and already introduced none rotated bitboard techniques to determine sliding piece attacks in 1997 ^[2]. Urban Koistinen became Editor of the Swedish PLY Computer Chess Magazine of the SSDF in 1997 ^[3], and in 2001, he proposed an efficient indexing scheme for endgame bitbases with few men, which is published under the GNU Free Documentation License ^[4]. He is active poster in CCRL Discussion Board - Endgame Tablebases ^[5].

Forum Posts

• bitmaps of rotated boards by Urban Koistinen, gnu.chess, March 2, 1995 » Rotated Bitboards
• Re: Rotated bitboards by Urban Koistinen, rgcc, October 31, 1997 » Collapsed files, Collapsed ranks
• Re: Datastructures in computer chess by Urban Koistinen, rgcc, May 17, 1999
• EGTB: Better algorithm by Urban Koistinen, CCC, April 07, 2001 ^[6]
• Generating egtbs ICGAJ by Tony Werten, CCC, December 04, 2001 ^[7]
  Wu/Beal predates Koistinen by Guy Haworth, CCC, December 04, 2001

External Links

• Urban Koistinen - homepage
• Computing endgames with few men by Urban Koistinen ^[8]
• Koistinen (Urban Koistinen) · GitHub
  Koistinen/Endgame · GitHub

References

1. ^ Re: Datastructures in computer chess by Urban Koistinen, rgcc, May 17, 1999
2. ^ Re: Rotated bitboards by Urban Koistinen, rgcc, October 31, 1997
3. ^ PLY/SSDF – the story - 1997
4. ^ Computing endgames with few men by Urban Koistinen
5. ^ CCRL Discussion Board • Search Koistinen
6. ^ Computing endgames with few men by Urban Koistinen
7. ^ Ren Wu, Don Beal (2001). Fast, Memory-efficient Retrograde Algorithms. ICGA Journal, Vol. 24, No. 3
8. ^ EGTB: Better algorithm by Urban Koistinen, CCC, April 07, 2001

What links here?

Up one level