Skip to main content
SpringerLink
Log in

Calculating the Crossing Probability on the Square Tessellation of a Connection Game with Random Move Order: The Algorithm and Its Complexity

  • Conference paper
Frontiers in Algorithmics (FAW 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8497))

Included in the following conference series:

Abstract

This paper presents an algorithm for calculating the crossing probability on the square tessellation of a connection game with random move order. The time complexity of the algorithm is O(poly(N)·2.7459...N), where N is the size of the tessellation. We conjecture that the bound is tight within a poly(N) term.

This work was supported by National Natural Science Foundation (NSFC) under grant No. 61373036.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Browne, C.: Connection Games. A.K. Peters, Ltd. (2005)

    Google Scholar 

  2. Peres, Y., Schramm, O., Sheffield, S., Wilson, D.B.: Random-turn hex and other selection games. American Mathematical Monthly 114, 373–387 (2007)

    MATH  MathSciNet  Google Scholar 

  3. Payne, S., Robeva, E.: Artificial intelligence for Bidding Hex, arXiv preprint arXiv:0812.3677 (2008)

    Google Scholar 

  4. Yang, Y., Zhou, S., Li, Y.: Square++: Making A Connection Game Win-Lose Complementary and Playing-Fair. Entertainment Computing 4(2), 105–113 (2013)

    Article  Google Scholar 

  5. Tromp, J., Farneback, G.: Combinatorics of Go. In: Proceedings of the Fifth International Conference on Computer and Games, Turin, Italy (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, Fudan University, Shanghai, 200433, China

    Yi Yang & Shuigeng Zhou

  2. Shanghai Key Lab of Intelligent Information Processing, Shanghai, 200433, China

    Shuigeng Zhou

  3. Department of Computer Science & Technology, Tongji University, Shanghai, 201804, China

    Jihong Guan

Authors
  1. Yi Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shuigeng Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jihong Guan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, Texas A&M University, USA

    Jianer Chen

  2. Cornell University, USA

    John E. Hopcroft

  3. School of Information Science and Engineering, Central South University, 410083, Changsha, China

    Jianxin Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Yang, Y., Zhou, S., Guan, J. (2014). Calculating the Crossing Probability on the Square Tessellation of a Connection Game with Random Move Order: The Algorithm and Its Complexity. In: Chen, J., Hopcroft, J.E., Wang, J. (eds) Frontiers in Algorithmics. FAW 2014. Lecture Notes in Computer Science, vol 8497. Springer, Cham. https://doi.org/10.1007/978-3-319-08016-1_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-08016-1_26

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-08015-4

  • Online ISBN: 978-3-319-08016-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation