Go Combinatorics!

In the 11th century, Shen Kuo calculated the number of possible weiqi ( go in Japanese; baduk in Korean) positions and recorded it in the Meng Xi Bi Tan . The game consists of a board with 19 × 19 19 \times 19 intersections in which black and white stones are placed on the intersections. However, Shen Kuo did not calculate the number of legal weiqi positions, which amounts to roughly 1.2% of all possible moves.

If N N represents the number of legal moves, calculate [ ln N ] \left[\ln{N}\right] .


The answer is 392.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Mikael Marcondes
Jan 24, 2015

Any intersection may be empty, with a white stone or with a black stone. Hence, there are 3 19.19 3^{19.19} positions. Since just 1.2 % 1.2\% are legal positions, l n N = l n 0.012 + 361. l n 3 = 392.18 ln\ N=ln\ 0.012+361.ln\ 3=392.18 , whose nearer integer is 392 \boxed{392} .

The problem was fairly simple. I don't understand how it was level 5.

Kunal Verma - 5 years, 8 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...