25,161
edits
Changes
Created page with "'''Home * People * Jun Nagashima''' FILE:nagashima.jpg|border|right|thumb|link=http://www.jaist.ac.jp/rccg/menu/member.htm| Jun Nagashim <ref>[http://www...."
'''[[Main Page|Home]] * [[People]] * Jun Nagashima'''
[[FILE:nagashima.jpg|border|right|thumb|link=http://www.jaist.ac.jp/rccg/menu/member.htm| Jun Nagashim <ref>[http://www.jaist.ac.jp/rccg/menu/member.htm Research Center for Computers and Games - Members]</ref> ]]
'''Jun Nagashima''',<br/>
a Japanese computer scientist at [[JAIST|Japan Advanced Institute of Science and Technology (JAIST)]] and before at [https://en.wikipedia.org/wiki/Shizuoka_University Shizuoka University], [https://en.wikipedia.org/wiki/Hamamatsu,_Shizuoka Hamamatsu], with research interests in Endgame Search, Game-refinement theory, [https://en.wikipedia.org/wiki/Mahjong Mah Jong], killer-tree heuristic and lambda-search method. He is member of [[Hiroyuki Iida|Hiroyuki Iida's]] ''games laboratory'', where he wrote the [[Lines of Action]] program [https://www.game-ai-forum.org/icga-tournaments/program.php?id=236 (T-T)], which participated at the [[7th Computer Olympiad|7th]] and [[8th Computer Olympiad]]. The program uses realization-probability search <ref>[http://icga.leidenuniv.nl/icga/games/Loa/ ICGA: Lines of Action] by [[Mark Winands]]</ref>.
Jun Nagashima received his Ph.D. ''Towards master-level play of Shogi'' from JAIST <ref>[[Jun Nagashima]] ('''2007'''). ''Towards master-level play of Shogi''. Ph.D. thesis, Supervisor [[Hiroyuki Iida]], [[JAIST]], [https://dspace.jaist.ac.jp/dspace/bitstream/10119/3565/3/034paper.pdf pdf]</ref>, which covers the broad range of aspects in developing a strong [[Shogi]] program, specially referring [[Tacos]], the four times Gold medal winner at [[Computer Olympiad|Computer Olympiads]], where Jun Nagashima is also member of the team headed by [[Tsuyoshi Hashimoto]].
=Selected Publications=
<ref>[http://ilk.uvt.nl/icga/journal/docs/References.pdf ICGA Reference Database] (pdf)</ref> <ref>[https://dblp.uni-trier.de/pers/hd/n/Nagashima:Jun dblp: Jun Nagashima]</ref>
==2000 ...==
* [[Jun Nagashima]] ('''2002'''). ''Realization-Probability Search: Its application to Shogi and LOA''. [[7th Computer Olympiad#Workshop|7th Computer Olympiad Workshop]]
* [[Makoto Sakuta]], [[Tsuyoshi Hashimoto]], [[Jun Nagashima]], [[Hiroyuki Iida]] ('''2002'''). ''Endgame-search techniques developed in shogi: application to Lines of Action''. JCIS 2002
* [[Jun Nagashima]], [[Masahumi Taketoshi]], [[Yoichiro Kajihara]], [[Tsuyoshi Hashimoto]], [[Hiroyuki Iida]] ('''2002'''). ''[http://ci.nii.ac.jp/naid/110006381103 An Efficient Use of Piece-Square Tables in Computer Shogi]''.
* [[Makoto Sakuta]], [[Tsuyoshi Hashimoto]], [[Jun Nagashima]], [[Jos Uiterwijk]], [[Hiroyuki Iida]] ('''2002'''). ''Application of the killer-tree heuristic and the lambda-search method to lines of action''. [http://www.journals.elsevier.com/information-sciences/ Information Sciences], Vol. 154, Nos. 3-4,
* [[Tsuyoshi Hashimoto]], [[Jun Nagashima]], [[Makoto Sakuta]], [[Jos Uiterwijk]], [[Hiroyuki Iida]] ('''2003'''). ''Automatic realization-probability search.'' Internal report, Dept. of Computer Sciences, [https://en.wikipedia.org/wiki/Shizuoka_University Shizuoka University], [https://en.wikipedia.org/wiki/Hamamatsu,_Shizuoka Hamamatsu]
* [[Hiroyuki Iida]], [[Kazutoshi Takahara]], [[Jun Nagashima]], [[Yoichiro Kajihara]], [[Tsuyoshi Hashimoto]] ('''2004'''). ''[http://www.springerlink.com/content/v0f3m478tmdhg23g/ An Application of Game-Refinement Theory to Mah Jong]''. ICEC'2004
==2005 ...==
* [[Jun Nagashima]] ('''2007'''). ''Towards master-level play of Shogi''. Ph.D. thesis, Supervisor [[Hiroyuki Iida]], [[JAIST]], [https://dspace.jaist.ac.jp/dspace/bitstream/10119/3565/3/034paper.pdf pdf]
=External Links=
* [https://www.game-ai-forum.org/icga-tournaments/person.php?id=224 Jun Nagashima's ICGA Tournaments]
* [http://www.mobygames.com/developer/sheet/view/developerId,254939/ Jun Nagashima Video Game Credits and Biography] - [https://en.wikipedia.org/wiki/MobyGames MobyGames]
=References=
<references />
'''[[People|Up one level]]'''
[[FILE:nagashima.jpg|border|right|thumb|link=http://www.jaist.ac.jp/rccg/menu/member.htm| Jun Nagashim <ref>[http://www.jaist.ac.jp/rccg/menu/member.htm Research Center for Computers and Games - Members]</ref> ]]
'''Jun Nagashima''',<br/>
a Japanese computer scientist at [[JAIST|Japan Advanced Institute of Science and Technology (JAIST)]] and before at [https://en.wikipedia.org/wiki/Shizuoka_University Shizuoka University], [https://en.wikipedia.org/wiki/Hamamatsu,_Shizuoka Hamamatsu], with research interests in Endgame Search, Game-refinement theory, [https://en.wikipedia.org/wiki/Mahjong Mah Jong], killer-tree heuristic and lambda-search method. He is member of [[Hiroyuki Iida|Hiroyuki Iida's]] ''games laboratory'', where he wrote the [[Lines of Action]] program [https://www.game-ai-forum.org/icga-tournaments/program.php?id=236 (T-T)], which participated at the [[7th Computer Olympiad|7th]] and [[8th Computer Olympiad]]. The program uses realization-probability search <ref>[http://icga.leidenuniv.nl/icga/games/Loa/ ICGA: Lines of Action] by [[Mark Winands]]</ref>.
Jun Nagashima received his Ph.D. ''Towards master-level play of Shogi'' from JAIST <ref>[[Jun Nagashima]] ('''2007'''). ''Towards master-level play of Shogi''. Ph.D. thesis, Supervisor [[Hiroyuki Iida]], [[JAIST]], [https://dspace.jaist.ac.jp/dspace/bitstream/10119/3565/3/034paper.pdf pdf]</ref>, which covers the broad range of aspects in developing a strong [[Shogi]] program, specially referring [[Tacos]], the four times Gold medal winner at [[Computer Olympiad|Computer Olympiads]], where Jun Nagashima is also member of the team headed by [[Tsuyoshi Hashimoto]].
=Selected Publications=
<ref>[http://ilk.uvt.nl/icga/journal/docs/References.pdf ICGA Reference Database] (pdf)</ref> <ref>[https://dblp.uni-trier.de/pers/hd/n/Nagashima:Jun dblp: Jun Nagashima]</ref>
==2000 ...==
* [[Jun Nagashima]] ('''2002'''). ''Realization-Probability Search: Its application to Shogi and LOA''. [[7th Computer Olympiad#Workshop|7th Computer Olympiad Workshop]]
* [[Makoto Sakuta]], [[Tsuyoshi Hashimoto]], [[Jun Nagashima]], [[Hiroyuki Iida]] ('''2002'''). ''Endgame-search techniques developed in shogi: application to Lines of Action''. JCIS 2002
* [[Jun Nagashima]], [[Masahumi Taketoshi]], [[Yoichiro Kajihara]], [[Tsuyoshi Hashimoto]], [[Hiroyuki Iida]] ('''2002'''). ''[http://ci.nii.ac.jp/naid/110006381103 An Efficient Use of Piece-Square Tables in Computer Shogi]''.
* [[Makoto Sakuta]], [[Tsuyoshi Hashimoto]], [[Jun Nagashima]], [[Jos Uiterwijk]], [[Hiroyuki Iida]] ('''2002'''). ''Application of the killer-tree heuristic and the lambda-search method to lines of action''. [http://www.journals.elsevier.com/information-sciences/ Information Sciences], Vol. 154, Nos. 3-4,
* [[Tsuyoshi Hashimoto]], [[Jun Nagashima]], [[Makoto Sakuta]], [[Jos Uiterwijk]], [[Hiroyuki Iida]] ('''2003'''). ''Automatic realization-probability search.'' Internal report, Dept. of Computer Sciences, [https://en.wikipedia.org/wiki/Shizuoka_University Shizuoka University], [https://en.wikipedia.org/wiki/Hamamatsu,_Shizuoka Hamamatsu]
* [[Hiroyuki Iida]], [[Kazutoshi Takahara]], [[Jun Nagashima]], [[Yoichiro Kajihara]], [[Tsuyoshi Hashimoto]] ('''2004'''). ''[http://www.springerlink.com/content/v0f3m478tmdhg23g/ An Application of Game-Refinement Theory to Mah Jong]''. ICEC'2004
==2005 ...==
* [[Jun Nagashima]] ('''2007'''). ''Towards master-level play of Shogi''. Ph.D. thesis, Supervisor [[Hiroyuki Iida]], [[JAIST]], [https://dspace.jaist.ac.jp/dspace/bitstream/10119/3565/3/034paper.pdf pdf]
=External Links=
* [https://www.game-ai-forum.org/icga-tournaments/person.php?id=224 Jun Nagashima's ICGA Tournaments]
* [http://www.mobygames.com/developer/sheet/view/developerId,254939/ Jun Nagashima Video Game Credits and Biography] - [https://en.wikipedia.org/wiki/MobyGames MobyGames]
=References=
<references />
'''[[People|Up one level]]'''
