Add ICLR anonymous submission

lichess.bib

@@ -24,6 +24,15 @@ @inproceedings{ambrona:2022:practical-algorithm-chess-unwinnability
   editor        = {Pierre Fraigniaud and Yushi Uno},
 }
 
+@inproceedings{anonymous-authors:2024:discovering-high-quality-chess-puzzles-offline-reinforcement-learning,
+  title         = {Discovering High-Quality Chess Puzzles Through One Billion Plays with Offline Reinforcement Learning},
+  author        = {Anonymous},
+  year          = {2024},
+  booktitle     = {Submitted to The Thirteenth International Conference on Learning Representations},
+  url           = {https://openreview.net/forum?id=YKW98Icu1X},
+  note          = {under review},
+}
+
 @inproceedings{barrish:2023:making-superhuman-ai-more-human,
   title         = {Making Superhuman {AI} More Human in Chess},
   author        = {Daniel Barrish and Steve Kroon and Brink van der Merwe},

lichess.html

@@ -210,6 +210,15 @@
 f<span>ü</span>r Informatik, 2022. doi:<a
 href="https://doi.org/10.4230/LIPICS.FUN.2022.2">10.4230/LIPICS.FUN.2022.2</a>.
 </div>
+<div
+id="ref-anonymous-authors:2024:discovering-high-quality-chess-puzzles-offline-reinforcement-learning"
+class="csl-entry" role="listitem">
+Anonymous. <span>“Discovering High-Quality Chess Puzzles Through One
+Billion Plays with Offline Reinforcement Learning.”</span> In
+<em>Submitted to the Thirteenth International Conference on Learning
+Representations</em>, 2024. <a
+href="https://openreview.net/forum?id=YKW98Icu1X">https://openreview.net/forum?id=YKW98Icu1X</a>.
+</div>
 <div id="ref-barrish:2023:making-superhuman-ai-more-human"
 class="csl-entry" role="listitem">
 Barrish, Daniel, Steve Kroon, and Brink van der Merwe. <span>“Making
@@ -409,6 +418,14 @@
 Intelligence</em>, 91–97. American Association of Artificial
 Intelligence, 2022.
 </div>
+<div
+id="ref-kuperwajs:2024:learning-from-rewards-social-information-strategic-behavior"
+class="csl-entry" role="listitem">
+Kuperwajs, Ionatan, Bas van Opheusden, Evan Russek, and Tom Griffiths.
+<span>“Learning from Rewards and Social Information in Naturalistic
+Strategic Behavior,”</span> August 2024. doi:<a
+href="https://doi.org/10.31234/osf.io/d8zje">10.31234/osf.io/d8zje</a>.
+</div>
 <div id="ref-laarhoven:2022:transparent-cheat-detection-online-chess"
 class="csl-entry" role="listitem">
 Laarhoven, Thijs, and Aditya Ponukumati. <span>“Towards Transparent