Difference between revisions of "Jun Nagashima"

From Chessprogramming wiki
Jump to: navigation, search
(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....")
 
Line 12: Line 12:
 
==2000 ...==
 
==2000 ...==
 
* [[Jun Nagashima]] ('''2002'''). ''Realization-Probability Search: Its application to Shogi and LOA''. [[7th Computer Olympiad#Workshop|7th Computer Olympiad Workshop]]
 
* [[Jun Nagashima]] ('''2002'''). ''Realization-Probability Search: Its application to Shogi and LOA''. [[7th Computer Olympiad#Workshop|7th Computer Olympiad Workshop]]
 +
* [[Masahumi Taketoshi]], [[Tsuyoshi Hashimoto]], [[Yoichiro Kajihara]], [[Jun Nagashima]], [[Hiroyuki Iida]] ('''2002'''). ''[http://jglobal.jst.go.jp/en/public/200902131683288984 Realization-Probability Search in Computer Shogi]''. [[Conferences#GPW7|7th Game Programming Workshop]] (Japanese)
 
* [[Makoto Sakuta]], [[Tsuyoshi Hashimoto]], [[Jun Nagashima]], [[Hiroyuki Iida]] ('''2002'''). ''Endgame-search techniques developed in shogi: application to Lines of Action''. JCIS 2002
 
* [[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]''.  
 
* [[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]''.  

Revision as of 16:59, 9 August 2018

Home * People * Jun Nagashima

Jun Nagashim [1]

Jun Nagashima,
a Japanese computer scientist at Japan Advanced Institute of Science and Technology (JAIST) and before at Shizuoka University, Hamamatsu, with research interests in Endgame Search, Game-refinement theory, Mah Jong, killer-tree heuristic and lambda-search method. He is member of Hiroyuki Iida's games laboratory, where he wrote the Lines of Action program (T-T), which participated at the 7th and 8th Computer Olympiad. The program uses realization-probability search [2].

Jun Nagashima received his Ph.D. Towards master-level play of Shogi from JAIST [3], which covers the broad range of aspects in developing a strong Shogi program, specially referring Tacos, the four times Gold medal winner at Computer Olympiads, where Jun Nagashima is also member of the team headed by Tsuyoshi Hashimoto.

Selected Publications

[4] [5]

2000 ...

2005 ...

External Links

References

Up one level