From 0b65f1023f7912392f356880115cef60c6dc02d2 Mon Sep 17 00:00:00 2001
From: Nemo <commits@captnemo.in>
Date: Fri, 8 Oct 2021 11:44:28 +0530
Subject: [PATCH] New thesis on Hanabi

---
 README.md              |  1 +
 boardgame-research.rdf | 25 +++++++++++++++++++++++++
 2 files changed, 26 insertions(+)

diff --git a/README.md b/README.md
index 5baf4b1..d06c8bb 100644
--- a/README.md
+++ b/README.md
@@ -152,6 +152,7 @@ If you aren't able to access any paper on this list, please [try using Sci-Hub](
 - [Hanabi Open Agent Dataset](https://github.com/aronsar/hoad) (computerProgram)
 - [Hanabi Open Agent Dataset](https://dl.acm.org/doi/10.5555/3463952.3464188) (conferencePaper)
 - [Evaluation of Human-AI Teams for Learned and Rule-Based Agents in Hanabi](http://arxiv.org/abs/2107.07630) (journalArticle)
+- [A Graphical User Interface For The Hanabi Challenge Benchmark](http://oru.diva-portal.org/smash/record.jsf?pid=diva2%3A1597503) (thesis)
 
 # Hive
 - [On the complexity of Hive](https://dspace.library.uu.nl/handle/1874/396955) (thesis)
diff --git a/boardgame-research.rdf b/boardgame-research.rdf
index 4a3898b..51fb54d 100644
--- a/boardgame-research.rdf
+++ b/boardgame-research.rdf
@@ -7813,6 +7813,30 @@ guaranteed decent high score. The algorithm got a lowest score of 79 and a
         <dc:rights>MIT License</dc:rights>
         <z:programmingLanguage>Java</z:programmingLanguage>
     </bib:Data>
+    <bib:Thesis rdf:about="http://oru.diva-portal.org/smash/record.jsf?pid=diva2%3A1597503">
+        <z:itemType>thesis</z:itemType>
+        <dc:publisher>
+            <foaf:Organization>
+                <foaf:name>Örebro University, School of Science and Technology.</foaf:name>
+            </foaf:Organization>
+        </dc:publisher>
+        <bib:authors>
+            <rdf:Seq>
+                <rdf:li>
+                    <foaf:Person>
+                       <foaf:surname>Nguyen, Van Hoa</foaf:surname>
+                    </foaf:Person>
+                </rdf:li>
+            </rdf:Seq>
+        </bib:authors>
+        <dc:title>A Graphical User Interface For The Hanabi Challenge Benchmark</dc:title>
+        <dcterms:abstract>This report will describe the development of the Graphical User Interface (GUI) forthe Hanabi Challenge Benchmark. The benchmark is based on the popular cardgame Hanabi and presents itself as a new research frontier in artificial intelligencefor cooperative multi-agent challenges. The project’s intentions and goals are tointerpret and visualize the data output from the benchmark to give us a better understandingof it.A GUI was then developed by using knowledge within theory of mind in combinationwith theories within human-computer interaction. The results of this project wereevaluated through a small-scale usability test. Users of different ages, gender andlevels of computer knowledge tested the application and through a questionnaire,the quality of the GUI was assessed.</dcterms:abstract>
+        <dc:identifier>
+            <dcterms:URI>
+                <rdf:value>http://oru.diva-portal.org/smash/record.jsf?pid=diva2%3A1597503</rdf:value>
+            </dcterms:URI>
+        </dc:identifier>
+    </bib:Thesis>
     <z:Collection rdf:about="#collection_6">
         <dc:title>2048</dc:title>
         <dcterms:hasPart rdf:resource="https://doi.org/10.1007%2F978-3-319-50935-8_8"/>
@@ -7911,6 +7935,7 @@ guaranteed decent high score. The algorithm got a lowest score of 79 and a
         <dcterms:hasPart rdf:resource="https://github.com/aronsar/hoad"/>
         <dcterms:hasPart rdf:resource="https://dl.acm.org/doi/10.5555/3463952.3464188"/>
         <dcterms:hasPart rdf:resource="http://arxiv.org/abs/2107.07630"/>
+        <dcterms:hasPart rdf:resource="http://oru.diva-portal.org/smash/record.jsf?pid=diva2%3A1597503"/>
     </z:Collection>
     <z:Collection rdf:about="#collection_26">
         <dc:title>Hive</dc:title>