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
1
application/pdf
+
+ thesis
+
+
+ Utrecht University
+
+
+
+
+
+
+ Andel
+ Daniël
+
+
+
+
+
+ On the complexity of Hive
+ 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.
+ May 2020
+ en-US
+ On the complexity of Hive
+
+
+ https://dspace.library.uu.nl/handle/1874/396955
+
+
+ 33
+ Bachelor thesis
+
+
+ attachment
+ Andel - 2020 - On the complexity of Hive.pdf
+ application/pdf
+
Accessibility
@@ -4011,6 +4047,10 @@ DOI: 10.1007/978-3-319-71649-7_5
+
+ Hive
+
+
Jenga