Changes

a Swedish mathematician and computer scientist. While affiliated with the [https://en.wikipedia.org/wiki/Royal_Institute_of_Technology KTH_Royal_Institute_of_Technology KTH Royal Institute of Technology] in [https://en.wikipedia.org/wiki/Stockholm Stockholm], he was active in computer chess programming <ref>[https://groups.google.com/d/msg/rec.games.chess.computer/L_roj2Mawg0/1lidUNmd3dsJ Re: Datastructures in computer chess] by [[Urban Koistinen]], [[Computer Chess Forums|rgcc]], May 17, 1999</ref>, and introduced [[Occupancy of any Line#CollapsedFiles|none rotated bitboard techniques]] to determine [[Sliding Piece Attacks|sliding piece attacks]] in 1997 <ref>[https://groups.google.com/d/msg/rec.games.chess.computer/YvFagyuVogw/2vNJw_qT8IYJ Re: Rotated bitboards] by [[Urban Koistinen]], [[Computer Chess Forums|rgcc]], October 31, 1997</ref>. Urban Koistinen became editor of the Swedish [[PLY (Magazine)|PLY]] Computer Chess Magazine of the [[SSDF]] in 1997 <ref>[http://privat.bahnhof.se/wb432434/historik.htm#1997 PLY/SSDF – the story - 1997]</ref>, and in 2001, he proposed an efficient indexing scheme for [[Endgame Bitbases|endgame bitbases]] with few men, which was published under the [https://en.wikipedia.org/wiki/GNU_Free_Documentation_License GNU Free Documentation License] <ref>[http://www.abc.se/~m10051/eg.txt Computing endgames with few men] by [[Urban Koistinen]]</ref>.