Fetching the paper…
Reading the bibliography…
Large language models (LLMs) have shown impressive capabilities in generating program code, opening exciting opportunities for applying program synthesis to games.
J. A. Fodor, The language of thought . Cambridge, MA: Harvard university press, 1975, vol. 5
1975
Earlier work this paper cites.
R. Coulom, “Efficient selectivity and backup operators in Monte-Carlo tree search,” in International conference on computers and games . Springer, 2006, pp. 72–83
2006
Earlier work this paper cites.
N. R. Sturtevant and A. M. White, “Feature construction for reinforcement learning in hearts,” in Computers and Games , H. J. van den Herik, P. Ciancarini, and H. H. L. M. J. Donkers, Eds. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 122–134
2007
Earlier work this paper cites.
N. Sturtevant, “An Analysis of UCT in Multiplayer Games,” ICGA Journal , p. 14, 2008
2008
Earlier work this paper cites.
O. Polozov and S. Gulwani, “Flashmeta: A framework for inductive program synthesis,” in Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications , October 2015, pp. 107–126
2015
Earlier work this paper cites.
D. Robilliard and C. Fonlupt, “Towards human-competitive game playing for complex board games with genetic programming,” in Artificial Evolution: 12th International Conference, Evolution Artificielle, EA 2015, Lyon, France, October 26-28, 2015 . Revised Selected Papers 12: Springer International Publishing, 2016, pp. 123–135
2016
Earlier work this paper cites.
G. Martinez-Arellano, R. Cant, and D. Woods, “Creating ai characters for fighting games using genetic programming,” IEEE transactions on computational intelligence and Ai in games , vol. 9, no. 4, pp. 423–434, 2016
2016
Earlier work this paper cites.
N. Shaker, J. Togelius, and M. J. Nelson, Procedural content generation in games , 2016
2016
Earlier work this paper cites.
S. Gulwani, O. Polozov, and R. Singh, “Program synthesis,” Foundations and Trends® in Programming Languages , vol. 4, no. 1-2, pp. 1–119, 2017
2017
Earlier work this paper cites.
E. Butler, K. Siu, and A. Zook, “Program synthesis as a generative method,” in Proceedings of the 12th International Conference on the Foundations of Digital Games , August 2017, pp. 1–10
2017
Earlier work this paper cites.
E. Butler, E. Torlak, and Z. Popović, “Synthesizing interpretable strategies for solving puzzle games,” in Proceedings of the 12th International Conference on the Foundations of Digital Games , August 2017, pp. 1–10
2017
Earlier work this paper cites.
S. E. Gaudl, “A genetic programming framework for 2d platform ai,” 2018, arXiv preprint
2018
Earlier work this paper cites.
D. G. Wilson, S. Cussat-Blanc, H. Luga, and J. F. Miller, “Evolving simple programs for playing atari games,” in Proceedings of the genetic and evolutionary computation conference , July 2018, pp. 229–236
2018
Earlier work this paper cites.
A. Verma, V. Murali, R. Singh, P. Kohli, and S. Chaudhuri, “Programmatically interpretable reinforcement learning,” in International Conference on Machine Learning . PMLR, July 2018, pp. 5045–5054
2018
Earlier work this paper cites.
A. Summerville, S. Snodgrass, M. Guzdial, C. Holmgård, A. K. Hoover, A. Isaksen, others, and J. Togelius, “Procedural content generation via machine learning (pcgml),” IEEE Transactions on Games , vol. 10, no. 3, pp. 257–270, 2018
2018
Earlier work this paper cites.
K. Young and T. Tian, “Minatar: An atari-inspired testbed for thorough and reproducible reinforcement learning experiments,” 2019, arXiv preprint
2019
Earlier work this paper cites.
A. Verma, H. Le, Y. Yue, and S. Chaudhuri, “Imitation-projected programmatic reinforcement learning,” Advances in Neural Information Processing Systems , vol. 32, 2019
2019
Earlier work this paper cites.
T. Silver, K. R. Allen, A. K. Lew, L. P. Kaelbling, and J. Tenenbaum, “Few-shot bayesian imitation learning with logical program policies,” in Proceedings of the AAAI Conference on Artificial Intelligence (Vol . No. 06: 34, April 2020, pp. 10 251–10 258
2020
Earlier work this paper cites.
M. Cook, “Software engineering for automated game design,” 2020 IEEE Conference on Games (CoG) , pp. 487–494, 2020
2020
Earlier work this paper cites.
R. D. Gaina, M. Balla, A. Dockhorn, R. Montoliu, and D. Perez-Liebana, “Design and implementation of tag: a tabletop games framework,” 2020, arXiv preprint
2020
Cited alongside, same era.
A. Cropper, R. Evans, and M. Law, “Inductive general game playing,” Machine Learning , vol. 109, pp. 1393–1434, 2020
2020
Cited alongside, same era.
M. Chen, J. Tworek, H. Jun, Q. Yuan, H. P. D. O. Pinto, J. Kaplan, others, and W. Zaremba, “Evaluating large language models trained on code,” 2021, arXiv preprint
2021
Cited alongside, same era.
J. R. H. Mariño, R. O. Moraes, T. C. Oliveira, C. Toledo, and L. H. S. Lelis, “Programmatic strategies for real-time strategy games,” Proceedings of the AAAI Conference on Artificial Intelligence , vol. 35, no. 1, pp. 381–389, May 2021
2021
Cited alongside, same era.
M. Kreminski and M. Mateas, “Opportunities for approachable game development via program synthesis,” in AIIDE Workshops , 2021
T. Dettmers, A. Pagnoni, A. Holtzman, and L. Zettlemoyer, “Qlora: Efficient finetuning of quantized llms,” Advances in neural information processing systems , vol. 36, pp. 10 088–10 115, 2023
2023
Later among the works it cites.
G. Todd, A. G. Padula, M. Stephenson, E. Piette, D. J. N. J. Soemers, and J. Togelius, “GAVEL: Generating games via evolution and language models,” in The Thirty-eighth Annual Conference on Neural Information Processing Systems , 2024
2024
Closest in time.
C. Hu, Y. Zhao, and J. Liu, “Generating games via llms: An investigation with video game description language,” 2024, arXiv preprint
2024
Closest in time.
A. Anjum, Y. Li, N. Law, M. Charity, and J. Togelius, “The ink splotch effect: A case study on chatgpt as a co-creative game designer,” in Proceedings of the 19th International Conference on the Foundations of Digital Games , May 2024, pp. 1–15
2024
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2021
Cited alongside, same era.
R. Evans, M. Bošnjak, L. Buesing, K. Ellis, D. Pfau, P. Kohli, and M. Sergot, “Making sense of raw input,” Artificial Intelligence , vol. 299, p. 103521, 2021
2021
Cited alongside, same era.
S. Chaudhuri, K. Ellis, O. Polozov, R. Singh, A. Solar-Lezama, Y. Yue et al. , “Neurosymbolic programming,” Foundations and Trends® in Programming Languages , vol. 7, no. 3, pp. 158–243, 2021
2021
Cited alongside, same era.
M. Charity and J. K. A. I. Togelius, “Competition: Solving puzzle levels in a dynamically changing mechanic space,” in 2022 IEEE Conference On Games (CoG) , 2022, pp. 570–575
2022
Cited alongside, same era.
J. Wei, X. Wang, D. Schuurmans, M. Bosma, brian ichter, F. Xia, E. H. Chi, Q. V. Le, and D. Zhou, “Chain of thought prompting elicits reasoning in large language models,” in Advances in Neural Information Processing Systems , A. H. Oh, A. Agarwal, D. Belgrave, and K. Cho, Eds., 2022
2022
Cited alongside, same era.
M. Eberhardinger, J. Maucher, and S. Maghsudi, “Learning of generalizable and interpretable knowledge in grid-based reinforcement learning environments,” in Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment (Vol . No. 1: 19, October 2023, pp. 203–214
2023
Cited alongside, same era.
D. S. Aleixo and L. H. Lelis, “Show me the way! bilevel search for synthesizing programmatic strategies,” in Proceedings of the AAAI Conference on Artificial Intelligence (Vol . No. 4: 37, June 2023, pp. 4991–4998
2023
Cited alongside, same era.
R. O. Moraes, D. S. Aleixo, L. N. Ferreira, and L. H. Lelis, “Choosing well your opponents: how to guide the synthesis of programmatic strategies,” in Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence , August 2023, pp. 4847–4854
2023
Cited alongside, same era.
S. Hu, Z. Huang, C. Hu, and J. Liu, “3d building generation in minecraft via large language models,” 2024, arXiv preprint
2024
Closest in time.
M. Liu, C. H. Yu, W. H. Lee, C. W. Hung, Y. C. Chen, and S. H. Sun, “Synthesizing programmatic reinforcement learning policies with large language model guided search,” 2024, arXiv preprint
2024
Closest in time.
H. Tang, D. Key, and K. Ellis, “Worldcoder, a model-based llm agent: Building world models by writing code and interacting with the environment,” 2024, arXiv preprint
2024
Closest in time.
C. Hocquette, A. Niskanen, R. Morel, M. Järvisalo, and A. Cropper, “Learning big logical rules by joining small rules,” 2024, arXiv preprint
2024
Closest in time.
C. Hocquette, A. Niskanen, M. Järvisalo, and A. Cropper, “Learning mdl logic programs from noisy data,” in Proceedings of the AAAI Conference on Artificial Intelligence (Vol . No. 9: 38, March 2024, pp. 10 553–10 561
2024
Closest in time.
Y. Gu, Q. Liu, Z. Li, and K. Zhang, “Knowpc: Knowledge-driven programmatic reinforcement learning for zero-shot coordination,” 2024, arXiv preprint
2024
Closest in time.
R. O. Moraes and L. H. Lelis, “Searching for programmatic policies in semantic spaces,” 2024, arXiv preprint
2024
Closest in time.
Q. A. Sadmine, H. Baier, and L. Lelis, “Language models speed up local search for finding programmatic policies,” Transactions on Machine Learning Research , 2024
2024
Closest in time.
M. Eberhardinger, F. Rupp, J. Maucher, and S. Maghsudi, “Unveiling the decision-making process in reinforcement learning with genetic programming,” in Advances in Swarm Intelligence . Singapore: Springer Nature Singapore, 2024, pp. 349–365
2024
Closest in time.
G. Wang, Y. Xie, Y. Jiang, A. Mandlekar, C. Xiao, Y. Zhu, L. Fan, and A. Anandkumar, “Voyager: An open-ended embodied agent with large language models,” Transactions on Machine Learning Research , 2024
2024
Closest in time.
Y. J. Ma, W. Liang, G. Wang, D.-A. Huang, O. Bastani, D. Jayaraman, Y. Zhu, L. Fan, and A. Anandkumar, “Eureka: Human-level reward design via coding large language models,” in The Twelfth International Conference on Learning Representations , 2024
2024
Closest in time.
B. Romera-Paredes, M. Barekatain, A. Novikov, M. Balog, M. P. Kumar, E. Dupont, others, and A. Fawzi, “Mathematical discoveries from program search with large language models,” Nature , vol. 625, no. 7995, pp. 468–475, 2024
2024
Closest in time.
G. Team, P. Georgiev, V. I. Lei, R. Burnell, L. Bai, A. Gulati, G. Tanzer, D. Vincent, Z. Pan, S. Wang et al. , “Gemini 1.5: Unlocking multimodal understanding across millions of tokens of context,” 2024, arXiv preprint
2024
Closest in time.
A. Dubey, A. Jauhri, A. Pandey, A. Kadian, A. Al-Dahle, A. Letman, others, and R. Ganapathy, “The llama 3 herd of models,” 2024, arXiv preprint
2024
Closest in time.