http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
- 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
- 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
RISS 인기검색어
- 검색키워드
- 저자 : Graham Farr (검색결과 2 건)
- 무료
- 기관 내 무료
- 유료
-
THE PROBABILISTIC METHOD MEETS GO
Graham Farr 대한수학회 2017 대한수학회지 Vol.54 No.4
Go is an ancient game of great complexity and has a huge following in East Asia. It is also very rich mathematically, and can be played on any graph, although it is usually played on a square lattice. As with any game, one of the most fundamental problems is to determine the number of legal positions, or the probability that a random position is legal. A random Go position is generated using a model previously studied by the author, with each vertex being independently Black, White or Uncoloured with probabilities $q,q,1-2q$ respectively. In this paper we consider the probability of legality for two scenarios. Firstly, for an $N\times N$ square lattice graph, we show that, with $q=cN^{-\alpha}$ and $c$ and $\alpha$ constant, as $N\rightarrow\infty$ the limiting probability of legality is 0, $\exp(-2c^5)$, and 1 according as $\alpha<2/5$, $\alpha=2/5$ and $\alpha>2/5$ respectively. On the way, we investigate the behaviour of the number of captured chains (or chromons). Secondly, for a random graph on $n$ vertices with edge probability $p$ generated according to the classical Gilbert-Erd\H{o}s-R\'enyi model $\mathcal{G}(n;p)$, we classify the main situations according to their asymptotic almost sure legality or illegality. Our results draw on a variety of probabilistic and enumerative methods including linearity of expectation, second moment method, factorial moments, polyomino enumeration, giant components in random graphs, and typicality of random structures. We conclude with suggestions for further work.
-
THE PROBABILISTIC METHOD MEETS GO
Farr, Graham Korean Mathematical Society 2017 대한수학회지 Vol.54 No.4
Go is an ancient game of great complexity and has a huge following in East Asia. It is also very rich mathematically, and can be played on any graph, although it is usually played on a square lattice. As with any game, one of the most fundamental problems is to determine the number of legal positions, or the probability that a random position is legal. A random Go position is generated using a model previously studied by the author, with each vertex being independently Black, White or Uncoloured with probabilities q, q, 1 - 2q respectively. In this paper we consider the probability of legality for two scenarios. Firstly, for an $N{\times}N$ square lattice graph, we show that, with $q=cN^{-{\alpha}}$ and c and ${\alpha}$ constant, as $N{\rightarrow}{\infty}$ the limiting probability of legality is 0, exp($-2c^5$), and 1 according as ${\alpha}$ < 2/5, ${\alpha}=2/5$ and ${\alpha}$ > 2/5 respectively. On the way, we investigate the behaviour of the number of captured chains (or chromons). Secondly, for a random graph on n vertices with edge probability p generated according to the classical $Gilbert-Erd{\ddot{o}}s-R{\acute{e}}nyi$ model ${\mathcal{G}}$(n; p), we classify the main situations according to their asymptotic almost sure legality or illegality. Our results draw on a variety of probabilistic and enumerative methods including linearity of expectation, second moment method, factorial moments, polyomino enumeration, giant components in random graphs, and typicality of random structures. We conclude with suggestions for further work.
연관 검색어 추천
이 검색어로 많이 본 자료
활용도 높은 자료
