Can Mathematics Improve Strategy in the Game of Go?

  • Context: Graduate 
  • Thread starter Thread starter Tenshou
  • Start date Start date
  • Tags Tags
    Game Mathematics
Click For Summary
SUMMARY

The discussion centers on the intersection of mathematics and strategy in the game of Go, specifically referencing the book "Mathematics and Go." Participants explore the application of Graph Theory and Network Deficiencies to identify weak points in Go strategies. The conversation highlights the limitations of current algorithms, noting that no existing program can achieve a 9-dan ranking. The mention of AlphaGo serves as a benchmark for algorithmic advancements in the game.

PREREQUISITES
  • Understanding of Go game mechanics and terminology
  • Familiarity with Graph Theory concepts
  • Knowledge of algorithmic efficiency and performance metrics
  • Basic comprehension of surreal numbers and their implications
NEXT STEPS
  • Research advanced Graph Theory techniques for analyzing network structures
  • Explore resources on identifying weaknesses in algorithmic strategies
  • Study the mathematical foundations of Go through the book "Mathematics and Go"
  • Investigate the development and capabilities of AlphaGo and similar AI programs
USEFUL FOR

This discussion is beneficial for game theorists, mathematicians, AI developers, and Go enthusiasts seeking to enhance their strategic understanding of the game through mathematical principles.

Tenshou
Messages
153
Reaction score
1
There is a book out there called Mathematics and Go (or the other way around, I am not sure). This book talks about an ancient game called Go (or in Chinese 围棋*wéiqì*) and the application of math to it, I think it can be done better since it does deal with surreal numbers and those do not really make sense to me. What I am trying to get at is, knowing that it is just graphical constructions(of networks) how do you find the weak points in the network? Is it possible to find such weakness in them? I believe things like this can make or break algorithmic efficiency, also to add insult to injury I head that there is no computer program on this planet that can be a 9p. Hope that will change. So, does anyone know anything about Graph Theory, Network Deficiencies(How to find defects in Graphical construction), and are you willing to lead me towards resources in which I, myself, can find how these works. So much please and thanks :)
 
Mathematics news on Phys.org

Similar threads

  • · Replies 6 ·
Replies
6
Views
4K
Replies
1
Views
1K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 24 ·
Replies
24
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 2 ·
Replies
2
Views
5K
Replies
11
Views
5K
  • · Replies 22 ·
Replies
22
Views
5K
  • · Replies 12 ·
Replies
12
Views
7K