×

Found 162 Documents (Results 1–100)

100
MathJax

Quantum-over-classical advantage in solving multiplayer games. (English) Zbl 07368099

Schmitz, Sylvain (ed.) et al., Reachability problems. 14th international conference, RP 2020, Paris, France, October 19–21, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12448, 83-98 (2020).
MSC:  68Qxx
PDF BibTeX XML Cite
Full Text: DOI arXiv

Generalised misère play. (English) Zbl 1444.91073

Larsson, Urban (ed.), Games of no chance 5. Papers of the BIRS workshop on combinatorial game theory, Banff, Canada, January 2011. Cambridge: Cambridge University Press. Math. Sci. Res. Inst. Publ. 70, 469-478 (2019).
MSC:  91A46
PDF BibTeX XML Cite

Geometric analysis of a generalized Wythoff game. (English) Zbl 1444.91060

Larsson, Urban (ed.), Games of no chance 5. Papers of the BIRS workshop on combinatorial game theory, Banff, Canada, January 2011. Cambridge: Cambridge University Press. Math. Sci. Res. Inst. Publ. 70, 343-372 (2019).
MSC:  91A46 91A05
PDF BibTeX XML Cite

Wythoff visions. (English) Zbl 1444.91055

Larsson, Urban (ed.), Games of no chance 5. Papers of the BIRS workshop on combinatorial game theory, Banff, Canada, January 2011. Cambridge: Cambridge University Press. Math. Sci. Res. Inst. Publ. 70, 35-87 (2019).
MSC:  91A46 91-02
PDF BibTeX XML Cite

On the quantum and classical complexity of solving subtraction games. (English) Zbl 07121070

van Bevern, René (ed.) et al., Computer science – theory and applications. 14th international computer science symposium in Russia, CSR 2019, Novosibirsk, Russia, July 1–5, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11532, 228-236 (2019).
MSC:  68Qxx
PDF BibTeX XML Cite
Full Text: DOI

Faster evaluation of subtraction games. (English) Zbl 07229764

Ito, Hiro (ed.) et al., 9th international conference on fun with algorithms, FUN 2018, June 13–15, 2018, La Maddalena Island, Italy. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 100, Article 20, 12 p. (2018).
MSC:  68Wxx
PDF BibTeX XML Cite
Full Text: DOI arXiv

Game values and computational complexity: an analysis via black-white combinatorial games. (English) Zbl 1472.68067

Elbassioni, Khaled (ed.) et al., Algorithms and computation. 26th international symposium, ISAAC 2015, Nagoya, Japan, December 9–11, 2015. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 9472, 689-699 (2015).
PDF BibTeX XML Cite
Full Text: DOI

New chocolate games. Variants of the game of Nim. (English) Zbl 1411.91158

Proceedings of the annual international conference on computational mathematics, computational geometry and statistics (CMCGS 2012), Singapore, January 30–31, 2012. Singapore: Global Science and Technology Forum (GSTF). 123-129 (2012).
MSC:  91A46 91-04
PDF BibTeX XML Cite

Winning Nim with Beatty and Fibonacci. (English) Zbl 1252.00011

Silva, Jorge Nuno (ed.), Proceedings of the recreational mathematics colloquium II, University of Évora, Portugal, April 27–30, 2011. Lisboa: Associação Ludus (ISBN 978-989-97346-2-3/pbk). 113-125 (2012).
MSC:  00A08 91A05
PDF BibTeX XML Cite

Filter Results by …

Document Type

Reviewing State

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Classification

all top 3

Software