25,161
edits
Changes
Created page with "'''Home * People * Urban Koistinen''' FILE:UrbanKoistinen.jpg|border|right|thumb|link=https://github.com/Koistinen|Urban Koistinen <ref>[https://github.c..."
'''[[Main Page|Home]] * [[People]] * Urban Koistinen'''
[[FILE:UrbanKoistinen.jpg|border|right|thumb|link=https://github.com/Koistinen|Urban Koistinen <ref>[https://github.com/Koistinen Koistinen (Urban Koistinen) · GitHub]</ref> ]]
'''Urban Koistinen''',<br/>
a Swedish mathematician and computer scientist. While affiliated with the [https://en.wikipedia.org/wiki/Royal_Institute_of_Technology 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>.
=Forum Posts=
==1995 ...==
* [https://groups.google.com/d/msg/gnu.chess/lSsvkY3St7s/wZ-3sG9rNmcJ bitmaps of rotated boards] by [[Urban Koistinen]], [[GNU Chess#NewsGroup|gnu.chess]], March 2, 1995 » [[Rotated Bitboards]]
* [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 » [[Occupancy of any Line#CollapsedFiles|Collapsed files]], [[Occupancy of any Line#CollapsedRanks|Collapsed ranks]]
* [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
==2000 ...==
* [https://groups.google.com/d/msg/rec.games.chess.computer/ZPlTuUrjErw/O8NMrDpcqiMJ Re: Does Unmake Move Really Save Time?] by [[Urban Koistinen]], [[Computer Chess Forums|rgcc]], March 09, 2001 » [[Unmake Move]]
* [https://www.stmintz.com/ccc/index.php?id=162252 EGTB: Better algorithm] by [[Urban Koistinen]], [[CCC]], April 07, 2001 <ref>[http://www.abc.se/~m10051/eg.txt Computing endgames with few men] by [[Urban Koistinen]]</ref>
* [https://www.stmintz.com/ccc/index.php?id=200335 Generating egtbs ICGAJ] by [[Tony van Roon-Werten|Tony Werten]], [[CCC]], December 04, 2001 <ref>[[Ren Wu]], [[Don Beal]] ('''2001'''). ''Fast, Memory-efficient Retrograde Algorithms''. [[ICGA Journal#24_3|ICGA Journal, Vol. 24, No. 3]]</ref>
: [https://www.stmintz.com/ccc/index.php?id=200376 Wu/Beal predates Koistinen] by [[Guy Haworth]], [[CCC]], December 04, 2001
==2005 ...==
* [https://groups.google.com/d/msg/rec.games.chess.computer/lXIoGtvZ9b4/6zSqwV5iZCsJ Re: Extending endgame database using grid computing?] by [[Urban Koistinen]], [[Computer Chess Forums|rgcc]], February 24, 2005
=External Links=
* [https://github.com/Koistinen Koistinen (Urban Koistinen) · GitHub]
: [https://github.com/Koistinen/Endgame Koistinen/Endgame · GitHub]
* [https://plus.google.com/116399237537276351098 Urban Koistinen - Google+]
* [http://teo.se/ Urban Koistinen - homepage]
* [http://www.abc.se/~m10051/eg.txt Computing endgames with few men] by [[Urban Koistinen]] <ref> [https://www.stmintz.com/ccc/index.php?id=162252 EGTB: Better algorithm] by [[Urban Koistinen]], [[CCC]], April 07, 2001</ref>
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Chess Programmer|Koistinen]]
[[FILE:UrbanKoistinen.jpg|border|right|thumb|link=https://github.com/Koistinen|Urban Koistinen <ref>[https://github.com/Koistinen Koistinen (Urban Koistinen) · GitHub]</ref> ]]
'''Urban Koistinen''',<br/>
a Swedish mathematician and computer scientist. While affiliated with the [https://en.wikipedia.org/wiki/Royal_Institute_of_Technology 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>.
=Forum Posts=
==1995 ...==
* [https://groups.google.com/d/msg/gnu.chess/lSsvkY3St7s/wZ-3sG9rNmcJ bitmaps of rotated boards] by [[Urban Koistinen]], [[GNU Chess#NewsGroup|gnu.chess]], March 2, 1995 » [[Rotated Bitboards]]
* [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 » [[Occupancy of any Line#CollapsedFiles|Collapsed files]], [[Occupancy of any Line#CollapsedRanks|Collapsed ranks]]
* [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
==2000 ...==
* [https://groups.google.com/d/msg/rec.games.chess.computer/ZPlTuUrjErw/O8NMrDpcqiMJ Re: Does Unmake Move Really Save Time?] by [[Urban Koistinen]], [[Computer Chess Forums|rgcc]], March 09, 2001 » [[Unmake Move]]
* [https://www.stmintz.com/ccc/index.php?id=162252 EGTB: Better algorithm] by [[Urban Koistinen]], [[CCC]], April 07, 2001 <ref>[http://www.abc.se/~m10051/eg.txt Computing endgames with few men] by [[Urban Koistinen]]</ref>
* [https://www.stmintz.com/ccc/index.php?id=200335 Generating egtbs ICGAJ] by [[Tony van Roon-Werten|Tony Werten]], [[CCC]], December 04, 2001 <ref>[[Ren Wu]], [[Don Beal]] ('''2001'''). ''Fast, Memory-efficient Retrograde Algorithms''. [[ICGA Journal#24_3|ICGA Journal, Vol. 24, No. 3]]</ref>
: [https://www.stmintz.com/ccc/index.php?id=200376 Wu/Beal predates Koistinen] by [[Guy Haworth]], [[CCC]], December 04, 2001
==2005 ...==
* [https://groups.google.com/d/msg/rec.games.chess.computer/lXIoGtvZ9b4/6zSqwV5iZCsJ Re: Extending endgame database using grid computing?] by [[Urban Koistinen]], [[Computer Chess Forums|rgcc]], February 24, 2005
=External Links=
* [https://github.com/Koistinen Koistinen (Urban Koistinen) · GitHub]
: [https://github.com/Koistinen/Endgame Koistinen/Endgame · GitHub]
* [https://plus.google.com/116399237537276351098 Urban Koistinen - Google+]
* [http://teo.se/ Urban Koistinen - homepage]
* [http://www.abc.se/~m10051/eg.txt Computing endgames with few men] by [[Urban Koistinen]] <ref> [https://www.stmintz.com/ccc/index.php?id=162252 EGTB: Better algorithm] by [[Urban Koistinen]], [[CCC]], April 07, 2001</ref>
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Chess Programmer|Koistinen]]
