Comments (1)
Recent:
'tree search
Investigating following position:
A B C D E F G H J K L M N O P Q R S T
19 O O O . O<. O O O O X O O O X . X . X 19
18 O O O O . O . O O O X X O . X . X X . 18
17 . O O O O . O O X X X X X X X . X . X 17
16 O . O X O . O O X . X . . X . . . X . 16
15 O O O X O O O X X . X X X X . . X X O 15
14 O X X X X X X X . . . . X . X X . . X 14
13 O X O X . . . X . . X . X . X . X . X 13
12 X X O X . X . . X . . . . X X X X X . 12
11 . . O X X . . . X . X X X X . . . X . 11
10 X X X X . X . X X X . . . X O . X X . 10
9 X . . . X . X . . . . . X . X X . X . 9
8 . . . . . X X X X X X X X . X X X . . 8
7 . X X . X X . X . . . . . X . . X . . 7
6 . . X X . . X . . . . . . . . . . . . 6
5 X X X X X X O X . . . . . . X O X . . 5
4 . . X . X X . . X X . . . . X X X . . 4
3 . . X X . X X X . X . X . . . . . . . 3
2 . . X X . . X . . . X . . . . . . . . 2
1 . . . . X X . X X X X . . . . . . . . 1
A B C D E F G H J K L M N O P Q R S T
Move: 300. Captures X: 104 O: 8
value: -268.5
tree search
Investigating following position:
A B C D E F G H J K L M N O P Q R S T
19 O O O . . . O O O O X O O O X . X . X 19
18 O O O O . O . O O O X X O . X . X X . 18
17 . O O O O . O O X X X X X X X . X . X 17
16 O . O X O . O O X . X . . X . . . X . 16
15 O O O X O O O X X . X X X X . . X X O 15
14 O X X X X X X X . . . . X . X X . . X 14
13 O X O X . . . X . . X . X . X . X . X 13
12 X X O X . X . . X . . . . X X X X X . 12
11 . . O X X . . . X . X X X X . . . X . 11
10 X X X X . X . X X X . . . X O . X X . 10
9 X . . . X . X . . . . . X . X X . X . 9
8 . . . . . X X X X X X X X . X X X . . 8
7 . X X . X X . X . . . . . X . . X . . 7
6 . . X X . . X . . . . . . . . O<. . . 6
5 X X X X X X O X . . . . . . X O X . . 5
4 . . X . X X . . X X . . . . X X X . . 4
3 . . X X . X X X . X . X . . . . . . . 3
2 . . X X . . X . . . X . . . . . . . . 2
1 . . . . X X . X X X X . . . . . . . . 1
A B C D E F G H J K L M N O P Q R S T
Move: 300. Captures X: 104 O: 8
value: -268.5
tree search
Investigating following position:
A B C D E F G H J K L M N O P Q R S T
19 O O O . . . O O O O X O O O X . X . X 19
18 O O O O . O . O O O X X O . X . X X . 18
17 . O O O O . O O X X X X X X X . X . X 17
16 O . O X O . O O X . X . . X . . . X . 16
15 O O O X O O O X X . X X X X . . X X O 15
14 O X X X X X X X . . . . X . X X . . X 14
13 O X O X . . . X . . X . X . X . X . X 13
12 X X O X . X . . X . . . . X X X X X . 12
11 . . O X X . . . X . X X X X . . . X . 11
10 X X X X . X . X X X . . . X O . X X . 10
9 X . . . X . X . . . . . X . X X . X . 9
8 . . . . . X X X X X X X X . X X X . . 8
7 . X X . X X . X . . . . . X . . X . . 7
6 . . X X . . X . . . . . . . . . . . . 6
5 X X X X X X O X . . . . . . X O X . . 5
4 . . X . X X . . X X . . . . X X X . . 4
3 . . X X . X X X . X . X . . . . . . . 3
2 . . X X . . X . . . X . . . . . O<. . 2
1 . . . . X X . X X X X . . . . . . . . 1
A B C D E F G H J K L M N O P Q R S T
Move: 300. Captures X: 104 O: 8
value: -268.5
tree search
Investigating following position:
A B C D E F G H J K L M N O P Q R S T
19 O O O . . . O O O O X O O O X . X . X 19
18 O O O O . O . O O O X X O . X . X X . 18
17 . O O O O . O O X X X X X X X . X . X 17
16 O . O X O . O O X . X . . X . . . X . 16
15 O O O X O O O X X . X X X X . . X X O 15
14 O X X X X X X X . . . . X . X X . . X 14
13 O X O X . . . X . . X . X . X . X . X 13
12 X X O X . X . . X . . . . X X X X X . 12
11 . . O X X . . . X . X X X X . . . X . 11
10 X X X X . X . X X X . . . X O . X X . 10
9 X . . . X . X . . . . . X . X X . X . 9
8 . . . . . X X X X X X X X . X X X . . 8
7 . X X . X X . X . . . . . X . . X . . 7
6 . . X X . . X . . . . . . . . . . . . 6
5 X X X X X X O X . . . . . . X O X . . 5
4 . . X . X X . . X X . . . . X X X . . 4
3 . . X X . X X X . X . X . . . . . . . 3
2 . . X X . . X . . . X . . . . O<. . . 2
1 . . . . X X . X X X X . . . . . . . . 1
A B C D E F G H J K L M N O P Q R S T
Move: 300. Captures X: 104 O: 8
value: -268.5
tree search
Investigating following position:
A B C D E F G H J K L M N O P Q R S T
19 O O O O<. . O O O O X O O O X . X . X 19
18 O O O O . O . O O O X X O . X . X X . 18
17 . O O O O . O O X X X X X X X . X . X 17
16 O . O X O . O O X . X . . X . . . X . 16
15 O O O X O O O X X . X X X X . . X X O 15
14 O X X X X X X X . . . . X . X X . . X 14
13 O X O X . . . X . . X . X . X . X . X 13
12 X X O X . X . . X . . . . X X X X X . 12
11 . . O X X . . . X . X X X X . . . X . 11
10 X X X X . X . X X X . . . X O . X X . 10
9 X . . . X . X . . . . . X . X X . X . 9
8 . . . . . X X X X X X X X . X X X . . 8
7 . X X . X X . X . . . . . X . . X . . 7
6 . . X X . . X . . . . . . . . . . . . 6
5 X X X X X X O X . . . . . . X O X . . 5
4 . . X . X X . . X X . . . . X X X . . 4
3 . . X X . X X X . X . X . . . . . . . 3
2 . . X X . . X . . . X . . . . . . . . 2
1 . . . . X X . X X X X . . . . . . . . 1
A B C D E F G H J K L M N O P Q R S T
Move: 300. Captures X: 104 O: 8
value: -268.5
tree search
Investigating following position:
A B C D E F G H J K L M N O P Q R S T
19 O O O . . . O O O O X O O O X . X . X 19
18 O O O O . O . O O O X X O . X . X X . 18
17 . O O O O . O O X X X X X X X . X . X 17
16 O . O X O . O O X . X . . X . . . X . 16
15 O O O X O O O X X . X X X X . . X X O 15
14 O X X X X X X X . . . . X . X X . . X 14
13 O X O X . . . X . . X . X . X . X . X 13
12 X X O X . X . . X . . . . X X X X X . 12
11 . . O X X . . . X . X X X X . . . X . 11
10 X X X X . X . X X X . . . X O . X X . 10
9 X . . . X . X . . . . . X . X X . X . 9
8 . . . . . X X X X X X X X . X X X . . 8
7 . X X . X X . X . . . . . X . . X . . 7
6 . . X X . . X . . . . . . . . . . . . 6
5 X X X X X X O X . . . . . . X O X . . 5
4 . . X . X X . . X X . . . . X X X . . 4
3 O<. X X . X X X . X . X . . . . . . . 3
2 . . X X . . X . . . X . . . . . . . . 2
1 . . . . X X . X X X X . . . . . . . . 1
A B C D E F G H J K L M N O P Q R S T
Move: 300. Captures X: 104 O: 8
value: -268.5
tree search
Investigating following position:
A B C D E F G H J K L M N O P Q R S T
19 O O O . . . O O O O X O O O X . X . X 19
18 O O O O . O . O O O X X O . X . X X . 18
17 . O O O O . O O X X X X X X X . X . X 17
16 O . O X O . O O X . X . . X . . . X . 16
15 O O O X O O O X X . X X X X . . X X O 15
14 O X X X X X X X . . . . X . X X . . X 14
13 O X O X . . . X . . X . X . X . X . X 13
12 X X O X . X . . X . . . . X X X X X . 12
11 . . O X X . . . X . X X X X . . . X . 11
10 X X X X . X . X X X . . . X O . X X . 10
9 X . . . X . X . . . . . X . X X . X . 9
8 O<. . . . X X X X X X X X . X X X . . 8
7 . X X . X X . X . . . . . X . . X . . 7
6 . . X X . . X . . . . . . . . . . . . 6
5 X X X X X X O X . . . . . . X O X . . 5
4 . . X . X X . . X X . . . . X X X . . 4
3 . . X X . X X X . X . X . . . . . . . 3
2 . . X X . . X . . . X . . . . . . . . 2
1 . . . . X X . X X X X . . . . . . . . 1
A B C D E F G H J K L M N O P Q R S T
Move: 300. Captures X: 104 O: 8
value: -268.5
tree search
Investigating following position:
A B C D E F G H J K L M N O P Q R S T
19 O O O . . . O O O O X O O O X . X . X 19
18 O O O O . O . O O O X X O . X . X X . 18
17 . O O O O . O O X X X X X X X . X . X 17
16 O . O X O . O O X . X . . X . . . X . 16
15 O O O X O O O X X . X X X X . . X X O 15
14 O X X X X X X X . . . . X . X X . . X 14
13 O X O X . . . X . . X . X . X . X . X 13
12 X X O X . X . . X . . . . X X X X X . 12
11 . . O X X . . . X . X X X X . . . X . 11
10 X X X X . X . X X X . . . X O . X X . 10
9 X . . . X . X . . . . . X . X X . X . 9
8 . . . . . X X X X X X X X . X X X . . 8
7 . X X . X X . X . . . . . X . . X . . 7
6 . . X X . . X . . . . . . . . . . . . 6
5 X X X X X X O X . . . . . . X O X . . 5
4 . . X . X X . . X X . . . . X X X . . 4
3 . . X X . X X X . X . X . . . . . O<. 3
2 . . X X . . X . . . X . . . . . . . . 2
1 . . . . X X . X X X X . . . . . . . . 1
A B C D E F G H J K L M N O P Q R S T
Move: 300. Captures X: 104 O: 8
value: -268.5
tree search
Investigating following position:
A B C D E F G H J K L M N O P Q R S T
19 O O O . . . O O O O X O O O X . X . X 19
18 O O O O . O . O O O X X O . X . X X . 18
17 O<O O O O . O O X X X X X X X . X . X 17
16 O . O X O . O O X . X . . X . . . X . 16
15 O O O X O O O X X . X X X X . . X X O 15
14 O X X X X X X X . . . . X . X X . . X 14
13 O X O X . . . X . . X . X . X . X . X 13
12 X X O X . X . . X . . . . X X X X X . 12
11 . . O X X . . . X . X X X X . . . X . 11
10 X X X X . X . X X X . . . X O . X X . 10
9 X . . . X . X . . . . . X . X X . X . 9
8 . . . . . X X X X X X X X . X X X . . 8
7 . X X . X X . X . . . . . X . . X . . 7
6 . . X X . . X . . . . . . . . . . . . 6
5 X X X X X X O X . . . . . . X O X . . 5
4 . . X . X X . . X X . . . . X X X . . 4
3 . . X X . X X X . X . X . . . . . . . 3
2 . . X X . . X . . . X . . . . . . . . 2
1 . . . . X X . X X X X . . . . . . . . 1
A B C D E F G H J K L M N O P Q R S T
Move: 300. Captures X: 104 O: 8
value: -268.5
tree search
Investigating following position:
A B C D E F G H J K L M N O P Q R S T
19 O O O . . . O O O O X O O O X . X . X 19
18 O O O O . O . O O O X X O . X . X X . 18
17 . O O O O . O O X X X X X X X . X . X 17
16 O . O X O . O O X . X . . X . . . X . 16
15 O O O X O O O X X . X X X X . . X X O 15
14 O X X X X X X X . . . . X . X X . . X 14
13 O X O X . . . X . . X . X . X . X . X 13
12 X X O X . X . . X . . . . X X X X X . 12
11 . . O X X . . . X . X X X X . . . X . 11
10 X X X X . X . X X X . . . X O . X X . 10
9 X . . . X . X . . . . . X . X X . X . 9
8 . . . . . X X X X X X X X . X X X . . 8
7 . X X . X X . X . . . . . X . . X . . 7
6 . . X X . . X . . . . . . . . . . . . 6
5 X X X X X X O X . . . . . . X O X . . 5
4 O<. X . X X . . X X . . . . X X X . . 4
3 . . X X . X X X . X . X . . . . . . . 3
2 . . X X . . X . . . X . . . . . . . . 2
1 . . . . X X . X X X X . . . . . . . . 1
A B C D E F G H J K L M N O P Q R S T
Move: 300. Captures X: 104 O: 8
value: -268.5
tree search
Investigating following position:
A B C D E F G H J K L M N O P Q R S T
19 O O O . . . O O O O X O O O X . X . X 19
18 O O O O . O . O O O X X O . X . X X . 18
17 . O O O O . O O X X X X X X X . X . X 17
16 O . O X O . O O X . X . . X . . . X . 16
15 O O O X O O O X X . X X X X . . X X O 15
14 O X X X X X X X . . . . X . X X . . X 14
13 O X O X . . . X . . X . X . X . X . X 13
12 X X O X . X . . X . . . . X X X X X . 12
11 . . O X X . . . X . X X X X . . . X . 11
10 X X X X . X . X X X . . . X O . X X . 10
9 X . . . X . X . . . . . X . X X . X . 9
8 . . . . . X X X X X X X X . X X X . . 8
7 . X X . X X . X . . . . . X . . X . . 7
6 . . X X . . X . . . . . . . . . . . . 6
5 X X X X X X O X . . . . . . X O X . . 5
4 . . X . X X . . X X . . . . X X X . . 4
3 . . X X . X X X . X . X . . . . . . . 3
2 . . X X . . X . . . X . . . O<. . . . 2
1 . . . . X X . X X X X . . . . . . . . 1
A B C D E F G H J K L M N O P Q R S T
Move: 300. Captures X: 104 O: 8
value: -252.5
tree search
Traceback (most recent call last):
File "D:\Programming\Python\mugo\MuGo-master\main.py", line 109, in
argh.dispatch(parser)
File "D:\ProgramData\Anaconda3\envs\tensorflow\lib\site-packages\argh\dispatching.py", line 174, in dispatch
for line in lines:
File "D:\ProgramData\Anaconda3\envs\tensorflow\lib\site-packages\argh\dispatching.py", line 277, in _execute_command
for line in result:
File "D:\ProgramData\Anaconda3\envs\tensorflow\lib\site-packages\argh\dispatching.py", line 260, in call
result = function(*positional, **keywords)
File "D:\Programming\Python\mugo\MuGo-master\main.py", line 51, in gtp
engine_reply = gtp_engine.send(cmd)
File "D:\ProgramData\Anaconda3\envs\tensorflow\lib\site-packages\gtp.py", line 154, in send
message_id, getattr(self, "cmd" + command)(arguments))
File "D:\ProgramData\Anaconda3\envs\tensorflow\lib\site-packages\gtp.py", line 222, in cmd_genmove
move = self._game.get_move(c)
File "D:\Programming\Python\mugo\MuGo-master\strategies.py", line 83, in get_move
move = self.suggest_move(self.position)
File "D:\Programming\Python\mugo\MuGo-master\strategies.py", line 238, in suggest_move
self.tree_search(root)
File "D:\Programming\Python\mugo\MuGo-master\strategies.py", line 248, in tree_search
position = chosen_leaf.compute_position()
File "D:\Programming\Python\mugo\MuGo-master\strategies.py", line 185, in compute_position
self.position = self.parent.position.play_move(self.move)
File "D:\Programming\Python\mugo\MuGo-master\go.py", line 354, in play_move
raise IllegalMove
go.IllegalMove'
from mugo.
Related Issues (20)
- After a long period of training, what will the training data accuracy incline? HOT 2
- About how to play MuGo HOT 8
- Group ID overflowed HOT 2
- error message "Key RL_glocal_step not found in checkpoint" HOT 2
- tensorflow.python.framework.errors_impl.NotFoundError: Key RL_global_step not found in checkpoint HOT 2
- SelfPlay Illegal Move HOT 4
- Error when start training HOT 8
- Error when prepossessing Chinese SGF HOT 1
- same game again and again HOT 1
- I want to let it train in itself.
- Error while prerunning it HOT 1
- Type of self.output in policy.py HOT 11
- RuntimeError: dictionary changed size during iteration HOT 3
- NameError: name 'read_file' is not defined HOT 1
- About how to fix argument problem. HOT 1
- AttributeError: 'PolicyNetwork' object has no attribute 'output' HOT 3
- could you help me to load MuGo in gtp gui like Sabaki? HOT 1
- max rollout depth exceeded! import copy rasied it ?
- SelfPlay Illegal Move
Recommend Projects
-
React
A declarative, efficient, and flexible JavaScript library for building user interfaces.
-
Vue.js
🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
-
Typescript
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
-
TensorFlow
An Open Source Machine Learning Framework for Everyone
-
Django
The Web framework for perfectionists with deadlines.
-
Laravel
A PHP framework for web artisans
-
D3
Bring data to life with SVG, Canvas and HTML. 📊📈🎉
-
Recommend Topics
-
javascript
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
-
web
Some thing interesting about web. New door for the world.
-
server
A server is a program made to process requests and deliver data to clients.
-
Machine learning
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
-
Visualization
Some thing interesting about visualization, use data art
-
Game
Some thing interesting about game, make everyone happy.
Recommend Org
-
Facebook
We are working to build community through open source technology. NB: members must have two-factor auth.
-
Microsoft
Open source projects and samples from Microsoft.
-
Google
Google ❤️ Open Source for everyone.
-
Alibaba
Alibaba Open Source for everyone
-
D3
Data-Driven Documents codes.
-
Tencent
China tencent open source team.
from mugo.