Skip to main content
SpringerLink
Log in

Linear algebraic approach on real σ-game

  • Published:
Journal of Applied Mathematics and Computing Aims and scope Submit manuscript

Abstract

We introduce a relationship between the Blackout game and automata theory. We introduce a concept of σ-game and find the optimal strategy to win the Blackout game and find a condition to determine the irreversibility of this game of larger size upto 19 x 19 Go board. Finally we verify our algorithm with a computer program in C++ based on our algorithm.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. M. Doob and W. H. Haemers,The complement of the path is determined by its spectrum, Linear Algebra Appl.356 (2002), 57–65.

    Article  MathSciNet  MATH  Google Scholar 

  2. E. Egerváry,On hypermatrices whose blocks are commutable in pairs and their application in lattice-dynamics, Acta Sci. Math. Szeged15 (1954), 211–222.

    MathSciNet  MATH  Google Scholar 

  3. M. Hunziker, A. Machiavelo and J. Park,Chebyshev polynomials over finite fields and reversibility of σ-automata on square grids, Theor. Comput. Sci.320 (2004), 465–483.

    Article  MathSciNet  MATH  Google Scholar 

  4. JAVA program by Universal Studios and DreamWorks,Movie: A Beautiful Mind, Blackout puzzle(2001), http://www.abeautifulmind.com/

  5. S.-G. Lee, I.-P. Kim, J.-B. Park, and J.-M. Yang,Linear algebra algorithm for the optimal solution in the Blackout game, J. of KSME Ser. A43 (2004), 87–96.

    Google Scholar 

  6. D. H. Pelletier,Merlin’s magic square, Amer. Math. Monthly94 (1987) 143–150

    Article  MathSciNet  MATH  Google Scholar 

  7. P. Rozsa and F. Romani,On periodic block-tridiagonal matrices, Linear Algebra Appl.167 (1992), 35–52.

    Article  MathSciNet  MATH  Google Scholar 

  8. K. Sutner,The σ-game and cellular automata, Amer. Math. Monthly97 (1990), 24–34.

    Article  MathSciNet  MATH  Google Scholar 

  9. S. Wolfram,Geometry of binomial coefficients, Amer. Math. Monthly91 (1984), 566–571.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Sungkyunkwan University, 440-746, Suwon, Korea

    Sang-Gu Lee

  2. Office of Research Innovation and Evaluation, Korea Research Foundation, Seocho-gu, 137-748, Seoul, Korea

    Jeong-Mo Yang

Authors
  1. Sang-Gu Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jeong-Mo Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sang-Gu Lee.

Additional information

This work was supported by the Com2MaC-SRC/ERC program of MOST/KOSEF (grant # R11-1999-054).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lee, SG., Yang, JM. Linear algebraic approach on real σ-game. J. Appl. Math. Comput. 21, 295–305 (2006). https://doi.org/10.1007/BF02896407

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02896407

AMS Mathematics Subject Classification

Key words and phrases

Search

Navigation