From 9803da39cfa2055582e59f13d8ef3e391056089e Mon Sep 17 00:00:00 2001
From: Nemo <me@captnemo.in>
Date: Tue, 28 Jul 2020 14:52:58 +0530
Subject: [PATCH] Adds Hive to exports

---
 boardgame-research.bib | 14 ++++++++++++++
 boardgame-research.rdf | 40 ++++++++++++++++++++++++++++++++++++++++
 2 files changed, 54 insertions(+)

diff --git a/boardgame-research.bib b/boardgame-research.bib
index 5290bcb..a74da88 100644
--- a/boardgame-research.bib
+++ b/boardgame-research.bib
@@ -921,3 +921,17 @@
 	pages = {75--95},
 	file = {Full Text:/home/nemo/Zotero/storage/B3NFVIMW/Heron et al. - 2018 - Eighteen Months of Meeple Like Us An Exploration .pdf:application/pdf}
 }
+
+@phdthesis{andel_complexity_2020,
+	type = {Bachelor thesis},
+	title = {On the complexity of {Hive}},
+	shorttitle = {On the complexity of {Hive}},
+	url = {https://dspace.library.uu.nl/handle/1874/396955},
+	abstract = {It is shown that for an arbitrary position of a Hive game where both players have the same set of N pieces it is PSPACE-hard to determine whether one of the players has a winning strategy. The proof is done by reducing the known PSPACE-complete set of true quantified boolean formulas to a game concerning these formulas, then to the game generalised geography, then to a version of that game with the restriction of having only nodes with maximum degree 3, and finally to generalised Hive. This thesis includes a short introduction to the subject of computational complexity.},
+	language = {en-US},
+	school = {Utrecht University},
+	author = {Andel, Daniël},
+	month = may,
+	year = {2020},
+	file = {Andel - 2020 - On the complexity of Hive.pdf:/home/nemo/Zotero/storage/5TWTM295/Andel - 2020 - On the complexity of Hive.pdf:application/pdf}
+}
diff --git a/boardgame-research.rdf b/boardgame-research.rdf
index c747eeb..33f1763 100644
--- a/boardgame-research.rdf
+++ b/boardgame-research.rdf
@@ -3977,6 +3977,42 @@ DOI: 10.1007/978-3-319-71649-7_5</dc:description>
         <z:linkMode>1</z:linkMode>
         <link:type>application/pdf</link:type>
     </z:Attachment>
+    <bib:Thesis rdf:about="https://dspace.library.uu.nl/handle/1874/396955">
+        <z:itemType>thesis</z:itemType>
+        <dc:publisher>
+            <foaf:Organization>
+               <foaf:name>Utrecht University</foaf:name>
+            </foaf:Organization>
+        </dc:publisher>
+        <bib:authors>
+            <rdf:Seq>
+                <rdf:li>
+                    <foaf:Person>
+                        <foaf:surname>Andel</foaf:surname>
+                        <foaf:givenName>Daniël</foaf:givenName>
+                    </foaf:Person>
+                </rdf:li>
+            </rdf:Seq>
+        </bib:authors>
+        <link:link rdf:resource="#item_222"/>
+        <dc:title>On the complexity of Hive</dc:title>
+        <dcterms:abstract>It is shown that for an arbitrary position of a Hive game where both players have the same set of N pieces it is PSPACE-hard to determine whether one of the players has a winning strategy. The proof is done by reducing the known PSPACE-complete set of true quantified boolean formulas to a game concerning these formulas, then to the game generalised geography, then to a version of that game with the restriction of having only nodes with maximum degree 3, and finally to generalised Hive. This thesis includes a short introduction to the subject of computational complexity.</dcterms:abstract>
+        <dc:date>May 2020</dc:date>
+        <z:language>en-US</z:language>
+        <z:shortTitle>On the complexity of Hive</z:shortTitle>
+        <dc:identifier>
+            <dcterms:URI>
+                <rdf:value>https://dspace.library.uu.nl/handle/1874/396955</rdf:value>
+            </dcterms:URI>
+        </dc:identifier>
+        <z:numPages>33</z:numPages>
+        <z:type>Bachelor thesis</z:type>
+    </bib:Thesis>
+    <z:Attachment rdf:about="#item_222">
+        <z:itemType>attachment</z:itemType>
+        <dc:title>Andel - 2020 - On the complexity of Hive.pdf</dc:title>
+        <link:type>application/pdf</link:type>
+    </z:Attachment>
     <z:Collection rdf:about="#collection_25">
         <dc:title>Accessibility</dc:title>
         <dcterms:hasPart rdf:resource="http://link.springer.com/10.1007/s40869-018-0057-8"/>
@@ -4011,6 +4047,10 @@ DOI: 10.1007/978-3-319-71649-7_5</dc:description>
         <dcterms:hasPart rdf:resource="https://github.com/rjtobin/HanSim"/>
         <dcterms:hasPart rdf:resource="https://github.com/Quuxplusone/Hanabi"/>
     </z:Collection>
+    <z:Collection rdf:about="#collection_26">
+        <dc:title>Hive</dc:title>
+        <dcterms:hasPart rdf:resource="https://dspace.library.uu.nl/handle/1874/396955"/>
+    </z:Collection>
     <z:Collection rdf:about="#collection_24">
         <dc:title>Jenga</dc:title>
         <dcterms:hasPart rdf:resource="https://www.llpjournal.org/2020/04/13/jidokan-jenga.html"/>