Joshua D. A. Jung

Joshua D. A. Jung

Auto-generated profile, based on publicly available information

Joshua D. A. Jung

University of Toronto, Mississaga, Canada

Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
9 July 2026
Verified
Conference Paper
Open access
NSNaaz Sibia
Naaz Sibia
JWJessica Wen
Jessica Wen
ZZZeling Zhang
Zeling Zhang
RYRunlong Ye
Runlong Ye
JJJoshua D. A. Jung
Joshua D. A. Jung
MLMichael Liut
Michael Liut

10 June 2025 in IEEE Transactions on Games
Verified
Journal Article
Closed access
JJJoshua D. A. Jung
Joshua D. A. Jung
Jesse HoeyJesse Hoey
Jesse Hoey
General Game Playing (GGP) is a field of study in which artificial agents are required to compete in games whose rules are not known until runtime. Monte Carlo Tree Search (MCTS) is popular in this domain for its ability to quickly simulate many instances of a game and run in whatever time it is given. Heuristics may be used to guide these simulations, but since the game is not known in advance, a typical MCTS agent cannot know which heuristics are useful, and must expend precious time to discover them. However, an agent able to take advantage of prior knowledge from other games can do better. This paper extends our publication at the 2024 IEEE Conference on Games [1]. As in that paper, we present a technique for automatically transferring heuristic knowledge between distinct, but similar, games. We show that this leads to better performance in games within the GGP framework, especially when initialization time is short, and we show that negative transfer is possible to detect and avoid. Unique to this paper, we give experimental results for an alternate method of negative transfer protection, and explore the application of our methods to single-player games.