Home *People * Urban Koistinen

Urban Koistinen^[1]

Urban Koistinen,
a Swedish mathematician and computer scientist. While affiliated with theKTH Royal Institute of Technology inStockholm, he was active in computer chess programming^[2], and introducednone rotated bitboard techniques to determinesliding piece attacks in 1997^[3]. Urban Koistinen became editor of the SwedishPLY Computer Chess Magazine of theSSDF in 1997^[4], and in 2001, he proposed an efficient indexing scheme forendgame bitbases with few men, which was published under theGNU Free Documentation License^[5].

Forum Posts

1995 ...

• bitmaps of rotated boards byUrban Koistinen,gnu.chess, March 2, 1995 »Rotated Bitboards
• Re: Rotated bitboards byUrban Koistinen,rgcc, October 31, 1997 »Collapsed files,Collapsed ranks
• Re: Datastructures in computer chess byUrban Koistinen,rgcc, May 17, 1999

2000 ...

• Re: Does Unmake Move Really Save Time? byUrban Koistinen,rgcc, March 09, 2001 »Unmake Move
• EGTB: Better algorithm byUrban Koistinen,CCC, April 07, 2001^[6]
• Generating egtbs ICGAJ byTony Werten,CCC, December 04, 2001^[7]

Wu/Beal predates Koistinen byGuy Haworth,CCC, December 04, 2001

• Re: Extending endgame database using grid computing? byUrban Koistinen,rgcc, February 24, 2005

2010 ...

• KK partitioning+very cheap compression fit in 8 GB (7-man) byUrban Koistinen,CCRL Discussion Board, May 30, 2010 »Endgame Tablebases
• Re: New 6-piece tablebase generator byUrban Koistinen,CCRL Discussion Board, April 23, 2013 »Syzygy Bases
• Re: 7-piece syzygy byUrban Koistinen,CCRL Discussion Board, June 09, 2015

External Links

• Koistinen (Urban Koistinen) · GitHub

Koistinen/Endgame · GitHub

• Urban Koistinen - Google+
• Urban Koistinen - homepage
• Computing endgames with few men byUrban Koistinen^[8]

References

Up one level

• Chess Programmer