Speed Up Simulation Function
Multi tool use
up vote
1
down vote
favorite
Part of the program I wrote simulates a chess game choosing random moves for each player until it's a draw or win for either player. It takes 3 seconds to complete 1 simulation and since it trains this way it will be much too slow to get real progress in chess because of the insane branching factor.
I tried dividing the most lengthy function in to multiple processes. This made it much slower because the function actually isn't that complicated and starting the processes takes longer than to just run it in one process. Is there any other way to speed this up?
simulation function:
# Random simulation
def roll_out(self):
self.visits += 1
settings.path.append(int(self.index))
board = copy.deepcopy(self.state) # starting state of board
player = Player(self.state, self.color)
opponent = Player(board, self.opp)
if checkmate(board, self.color): # is the starting state already checkmate?
value, self.win = 20, True
settings.value[self.color] = value
return
if opponent.draw: # is the starting state already a draw?
value, self.draw = 5, True
settings.value[self.color] = value
return
for i in range(1000):
self.random_move(opponent, board) # moves a random piece
player.set_moves(board) # update our legal moves
if player.draw:
value = 5
settings.value[self.color] = value
return
if opponent.won:
value = 0
settings.value[self.color] = value
return
if len(opponent.pieces) == 1 and len(player.pieces) == 1:
value = 5
settings.value[self.color] = value
return
self.random_move(player, board) # moves a random piece
opponent.set_moves(board) # update opponents legal moves
if opponent.draw:
value = 5
settings.value[self.color] = value
return
if player.won:
value = 20
settings.value[self.color] = value
return
if len(player.pieces) == 1 and len(opponent.pieces) == 1:
value = 5
settings.value[self.color] = value
return
python performance python-3.x simulation chess
edited 1 hour ago
alecxe
14.6k53377
asked 1 hour ago
Bas Velden
61
New contributor
Bas Velden is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
add a comment |
up vote
1
down vote
favorite
Part of the program I wrote simulates a chess game choosing random moves for each player until it's a draw or win for either player. It takes 3 seconds to complete 1 simulation and since it trains this way it will be much too slow to get real progress in chess because of the insane branching factor.
I tried dividing the most lengthy function in to multiple processes. This made it much slower because the function actually isn't that complicated and starting the processes takes longer than to just run it in one process. Is there any other way to speed this up?
simulation function:
# Random simulation
def roll_out(self):
self.visits += 1
settings.path.append(int(self.index))
board = copy.deepcopy(self.state) # starting state of board
player = Player(self.state, self.color)
opponent = Player(board, self.opp)
if checkmate(board, self.color): # is the starting state already checkmate?
value, self.win = 20, True
settings.value[self.color] = value
return
if opponent.draw: # is the starting state already a draw?
value, self.draw = 5, True
settings.value[self.color] = value
return
for i in range(1000):
self.random_move(opponent, board) # moves a random piece
player.set_moves(board) # update our legal moves
if player.draw:
value = 5
settings.value[self.color] = value
return
if opponent.won:
value = 0
settings.value[self.color] = value
return
if len(opponent.pieces) == 1 and len(player.pieces) == 1:
value = 5
settings.value[self.color] = value
return
self.random_move(player, board) # moves a random piece
opponent.set_moves(board) # update opponents legal moves
if opponent.draw:
value = 5
settings.value[self.color] = value
return
if player.won:
value = 20
settings.value[self.color] = value
return
if len(player.pieces) == 1 and len(opponent.pieces) == 1:
value = 5
settings.value[self.color] = value
return
python performance python-3.x simulation chess
edited 1 hour ago
alecxe
14.6k53377
asked 1 hour ago
Bas Velden
61
New contributor
Bas Velden is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
If possible, don't write it in Python. C would be faster.
– Reinderien
50 mins ago
@Reinderien I was afraid I would get that answer... Should I code it from scratch? Also, is it possible to write the chess code in C, but leave the machine learning code in python?
– Bas Velden
46 mins ago
You can do whatever you want :) You can invoke a C library through FFI, or you can run a C process and communicate with it via IPC, or you can find a pure C machine learning library... lots of options.
– Reinderien
7 mins ago
add a comment |
up vote
1
down vote
favorite
up vote
1
down vote
favorite
Part of the program I wrote simulates a chess game choosing random moves for each player until it's a draw or win for either player. It takes 3 seconds to complete 1 simulation and since it trains this way it will be much too slow to get real progress in chess because of the insane branching factor.
I tried dividing the most lengthy function in to multiple processes. This made it much slower because the function actually isn't that complicated and starting the processes takes longer than to just run it in one process. Is there any other way to speed this up?
simulation function:
# Random simulation
def roll_out(self):
self.visits += 1
settings.path.append(int(self.index))
board = copy.deepcopy(self.state) # starting state of board
player = Player(self.state, self.color)
opponent = Player(board, self.opp)
if checkmate(board, self.color): # is the starting state already checkmate?
value, self.win = 20, True
settings.value[self.color] = value
return
if opponent.draw: # is the starting state already a draw?
value, self.draw = 5, True
settings.value[self.color] = value
return
for i in range(1000):
self.random_move(opponent, board) # moves a random piece
player.set_moves(board) # update our legal moves
if player.draw:
value = 5
settings.value[self.color] = value
return
if opponent.won:
value = 0
settings.value[self.color] = value
return
if len(opponent.pieces) == 1 and len(player.pieces) == 1:
value = 5
settings.value[self.color] = value
return
self.random_move(player, board) # moves a random piece
opponent.set_moves(board) # update opponents legal moves
if opponent.draw:
value = 5
settings.value[self.color] = value
return
if player.won:
value = 20
settings.value[self.color] = value
return
if len(player.pieces) == 1 and len(opponent.pieces) == 1:
value = 5
settings.value[self.color] = value
return
python performance python-3.x simulation chess
edited 1 hour ago
alecxe
14.6k53377
asked 1 hour ago
Bas Velden
61
New contributor
Bas Velden is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
Part of the program I wrote simulates a chess game choosing random moves for each player until it's a draw or win for either player. It takes 3 seconds to complete 1 simulation and since it trains this way it will be much too slow to get real progress in chess because of the insane branching factor.
I tried dividing the most lengthy function in to multiple processes. This made it much slower because the function actually isn't that complicated and starting the processes takes longer than to just run it in one process. Is there any other way to speed this up?
simulation function:
# Random simulation
def roll_out(self):
self.visits += 1
settings.path.append(int(self.index))
board = copy.deepcopy(self.state) # starting state of board
player = Player(self.state, self.color)
opponent = Player(board, self.opp)
if checkmate(board, self.color): # is the starting state already checkmate?
value, self.win = 20, True
settings.value[self.color] = value
return
if opponent.draw: # is the starting state already a draw?
value, self.draw = 5, True
settings.value[self.color] = value
return
for i in range(1000):
self.random_move(opponent, board) # moves a random piece
player.set_moves(board) # update our legal moves
if player.draw:
value = 5
settings.value[self.color] = value
return
if opponent.won:
value = 0
settings.value[self.color] = value
return
if len(opponent.pieces) == 1 and len(player.pieces) == 1:
value = 5
settings.value[self.color] = value
return
self.random_move(player, board) # moves a random piece
opponent.set_moves(board) # update opponents legal moves
if opponent.draw:
value = 5
settings.value[self.color] = value
return
if player.won:
value = 20
settings.value[self.color] = value
return
if len(player.pieces) == 1 and len(opponent.pieces) == 1:
value = 5
settings.value[self.color] = value
return
python performance python-3.x simulation chess
python performance python-3.x simulation chess
edited 1 hour ago
alecxe
14.6k53377
asked 1 hour ago
Bas Velden
61
New contributor
Bas Velden is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
edited 1 hour ago
alecxe
14.6k53377
asked 1 hour ago
Bas Velden
61
New contributor
Bas Velden is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
edited 1 hour ago
alecxe
14.6k53377
edited 1 hour ago
alecxe
14.6k53377
edited 1 hour ago
alecxe
14.6k53377
14.6k53377
asked 1 hour ago
Bas Velden
61
New contributor
Bas Velden is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked 1 hour ago
Bas Velden
61
asked 1 hour ago
Bas Velden
61
61
New contributor
Bas Velden is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
Bas Velden is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
Bas Velden is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
If possible, don't write it in Python. C would be faster.
– Reinderien
50 mins ago
@Reinderien I was afraid I would get that answer... Should I code it from scratch? Also, is it possible to write the chess code in C, but leave the machine learning code in python?
– Bas Velden
46 mins ago
You can do whatever you want :) You can invoke a C library through FFI, or you can run a C process and communicate with it via IPC, or you can find a pure C machine learning library... lots of options.
– Reinderien
7 mins ago
add a comment |
If possible, don't write it in Python. C would be faster.
– Reinderien
50 mins ago
@Reinderien I was afraid I would get that answer... Should I code it from scratch? Also, is it possible to write the chess code in C, but leave the machine learning code in python?
– Bas Velden
46 mins ago
You can do whatever you want :) You can invoke a C library through FFI, or you can run a C process and communicate with it via IPC, or you can find a pure C machine learning library... lots of options.
– Reinderien
7 mins ago
If possible, don't write it in Python. C would be faster.
– Reinderien
50 mins ago
If possible, don't write it in Python. C would be faster.
– Reinderien
50 mins ago
@Reinderien I was afraid I would get that answer... Should I code it from scratch? Also, is it possible to write the chess code in C, but leave the machine learning code in python?
– Bas Velden
46 mins ago
@Reinderien I was afraid I would get that answer... Should I code it from scratch? Also, is it possible to write the chess code in C, but leave the machine learning code in python?
– Bas Velden
46 mins ago
You can do whatever you want :) You can invoke a C library through FFI, or you can run a C process and communicate with it via IPC, or you can find a pure C machine learning library... lots of options.
– Reinderien
7 mins ago
You can do whatever you want :) You can invoke a C library through FFI, or you can run a C process and communicate with it via IPC, or you can find a pure C machine learning library... lots of options.
– Reinderien
7 mins ago
add a comment |
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["\$", "\$"]]);
});
});
}, "mathjax-editing");
StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "196"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Bas Velden is a new contributor. Be nice, and check out our Code of Conduct.
draft saved
draft discarded
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f209770%2fspeed-up-simulation-function%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
Bas Velden is a new contributor. Be nice, and check out our Code of Conduct.
draft saved
draft discarded
Bas Velden is a new contributor. Be nice, and check out our Code of Conduct.
Bas Velden is a new contributor. Be nice, and check out our Code of Conduct.
Bas Velden is a new contributor. Be nice, and check out our Code of Conduct.
Thanks for contributing an answer to Code Review Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
draft saved
draft discarded
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f209770%2fspeed-up-simulation-function%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
UKb56oB,H2tR8WxpjcZcWWDjBa lx7nfiTN4CY3F,Fl,1lAeO OTKmop2WdTDp3Jwkd RE8e ywfPVwOcqDZ,5PwHKxpmPuAx4 sz8ms
If possible, don't write it in Python. C would be faster.
– Reinderien
50 mins ago
@Reinderien I was afraid I would get that answer... Should I code it from scratch? Also, is it possible to write the chess code in C, but leave the machine learning code in python?
– Bas Velden
46 mins ago
You can do whatever you want :) You can invoke a C library through FFI, or you can run a C process and communicate with it via IPC, or you can find a pure C machine learning library... lots of options.
– Reinderien
7 mins ago