This is a temporary, read-only recovery of the chessprogrammingwiki while a longer-term plan is worked out. Editing is not possible right now, but will be again soon.
Chess Programming Wiki All pages Other namespaces

Jun Nagashima

Home * People * Jun Nagashima

Jun Nagashim 1Jun Nagashim 1


  1. Research Center for Computers and Games - Members↩︎

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 1.

Jun Nagashima received his Ph.D. Towards master-level play of Shogi from JAIST 2, 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.

Contents
  1. Selected Publications
    1. 2000 ...
    2. 2005 ...
  2. External Links
  3. References

Selected Publications

3 4

2000 ...

2005 ...

References

Up one level


  1. ICGA: Lines of Action by Mark Winands↩︎

  2. Jun Nagashima (2007). Towards master-level play of Shogi. Ph.D. thesis, Supervisor Hiroyuki Iida, JAIST, pdf↩︎

  3. ICGA Reference Database↩︎

  4. dblp: Jun Nagashima↩︎

Categories: Lines of Action Programmer · Shogi Programmer

What links here

Contributors: GerdIsenberg.