Is there a way to compress this?
0
$begingroup$
This code seems very large and clunky, but I don't know any way of compressing it and making it smaller. Does anyone have any solutions?
try:
if gameBoard[b + 1][v] == "["+playerData[playerNum][0]+"]" and gameBoard[b + 2][v] == "["+playerData[playerNum][0]+"]":
noLine(playerNum)
return
elif gameBoard[b][v + 1] == "["+playerData[playerNum][0]+"]" and gameBoard[b][v + 2] == "["+playerData[playerNum][0]+"]":
noLine(playerNum)
return
elif gameBoard[b - 1][v] == "["+playerData[playerNum][0]+"]" and gameBoard[b - 2][v] == "["+playerData[playerNum][0]+"]":
noLine(playerNum)
return
elif gameBoard[b][v - 1] == "["+playerData[playerNum][0]+"]" and gameBoard[b][v - 2] == "["+playerData[playerNum][0]+"]":
noLine(playerNum)
return
except:
try:
if gameBoard[b + 1][v] == "["+playerData[playerNum][0]+"]" and gameBoard[b + 2][v] == "["+playerData[playerNum][0]+"]":
noLine(playerNum)
return
except:
if gameBoard[b - 1][v] == "["+playerData[playerNum][0]+"]" and gameBoard[b - 2][v] == "["+playerData[playerNum][0]+"]":
noLine(playerNum)
return
try:
if gameBoard[b][v + 1] == "["+playerData[playerNum][0]+"]" and gameBoard[b][v + 2] == "["+playerData[playerNum][0]+"]":
noLine(playerNum)
return
except:
if gameBoard[b][v - 1] == "["+playerData[playerNum][0]+"]" and gameBoard[b][v - 2] == "["+playerData[playerNum][0]+"]":
noLine(playerNum)
returnThe code works fine, it just doesn't seem very elegant.
python python-3.x compression
asked 11 mins ago
WimpyLlamaWimpyLlama
1
New contributor
WimpyLlama is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
add a comment |
0
$begingroup$
This code seems very large and clunky, but I don't know any way of compressing it and making it smaller. Does anyone have any solutions?
try:
if gameBoard[b + 1][v] == "["+playerData[playerNum][0]+"]" and gameBoard[b + 2][v] == "["+playerData[playerNum][0]+"]":
noLine(playerNum)
return
elif gameBoard[b][v + 1] == "["+playerData[playerNum][0]+"]" and gameBoard[b][v + 2] == "["+playerData[playerNum][0]+"]":
noLine(playerNum)
return
elif gameBoard[b - 1][v] == "["+playerData[playerNum][0]+"]" and gameBoard[b - 2][v] == "["+playerData[playerNum][0]+"]":
noLine(playerNum)
return
elif gameBoard[b][v - 1] == "["+playerData[playerNum][0]+"]" and gameBoard[b][v - 2] == "["+playerData[playerNum][0]+"]":
noLine(playerNum)
return
except:
try:
if gameBoard[b + 1][v] == "["+playerData[playerNum][0]+"]" and gameBoard[b + 2][v] == "["+playerData[playerNum][0]+"]":
noLine(playerNum)
return
except:
if gameBoard[b - 1][v] == "["+playerData[playerNum][0]+"]" and gameBoard[b - 2][v] == "["+playerData[playerNum][0]+"]":
noLine(playerNum)
return
try:
if gameBoard[b][v + 1] == "["+playerData[playerNum][0]+"]" and gameBoard[b][v + 2] == "["+playerData[playerNum][0]+"]":
noLine(playerNum)
return
except:
if gameBoard[b][v - 1] == "["+playerData[playerNum][0]+"]" and gameBoard[b][v - 2] == "["+playerData[playerNum][0]+"]":
noLine(playerNum)
returnThe code works fine, it just doesn't seem very elegant.
python python-3.x compression
asked 11 mins ago
WimpyLlamaWimpyLlama
1
New contributor
WimpyLlama is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
add a comment |
0
0
0
$begingroup$
This code seems very large and clunky, but I don't know any way of compressing it and making it smaller. Does anyone have any solutions?
try:
if gameBoard[b + 1][v] == "["+playerData[playerNum][0]+"]" and gameBoard[b + 2][v] == "["+playerData[playerNum][0]+"]":
noLine(playerNum)
return
elif gameBoard[b][v + 1] == "["+playerData[playerNum][0]+"]" and gameBoard[b][v + 2] == "["+playerData[playerNum][0]+"]":
noLine(playerNum)
return
elif gameBoard[b - 1][v] == "["+playerData[playerNum][0]+"]" and gameBoard[b - 2][v] == "["+playerData[playerNum][0]+"]":
noLine(playerNum)
return
elif gameBoard[b][v - 1] == "["+playerData[playerNum][0]+"]" and gameBoard[b][v - 2] == "["+playerData[playerNum][0]+"]":
noLine(playerNum)
return
except:
try:
if gameBoard[b + 1][v] == "["+playerData[playerNum][0]+"]" and gameBoard[b + 2][v] == "["+playerData[playerNum][0]+"]":
noLine(playerNum)
return
except:
if gameBoard[b - 1][v] == "["+playerData[playerNum][0]+"]" and gameBoard[b - 2][v] == "["+playerData[playerNum][0]+"]":
noLine(playerNum)
return
try:
if gameBoard[b][v + 1] == "["+playerData[playerNum][0]+"]" and gameBoard[b][v + 2] == "["+playerData[playerNum][0]+"]":
noLine(playerNum)
return
except:
if gameBoard[b][v - 1] == "["+playerData[playerNum][0]+"]" and gameBoard[b][v - 2] == "["+playerData[playerNum][0]+"]":
noLine(playerNum)
returnThe code works fine, it just doesn't seem very elegant.
python python-3.x compression
asked 11 mins ago
WimpyLlamaWimpyLlama
1
New contributor
WimpyLlama is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
This code seems very large and clunky, but I don't know any way of compressing it and making it smaller. Does anyone have any solutions?
try:
if gameBoard[b + 1][v] == "["+playerData[playerNum][0]+"]" and gameBoard[b + 2][v] == "["+playerData[playerNum][0]+"]":
noLine(playerNum)
return
elif gameBoard[b][v + 1] == "["+playerData[playerNum][0]+"]" and gameBoard[b][v + 2] == "["+playerData[playerNum][0]+"]":
noLine(playerNum)
return
elif gameBoard[b - 1][v] == "["+playerData[playerNum][0]+"]" and gameBoard[b - 2][v] == "["+playerData[playerNum][0]+"]":
noLine(playerNum)
return
elif gameBoard[b][v - 1] == "["+playerData[playerNum][0]+"]" and gameBoard[b][v - 2] == "["+playerData[playerNum][0]+"]":
noLine(playerNum)
return
except:
try:
if gameBoard[b + 1][v] == "["+playerData[playerNum][0]+"]" and gameBoard[b + 2][v] == "["+playerData[playerNum][0]+"]":
noLine(playerNum)
return
except:
if gameBoard[b - 1][v] == "["+playerData[playerNum][0]+"]" and gameBoard[b - 2][v] == "["+playerData[playerNum][0]+"]":
noLine(playerNum)
return
try:
if gameBoard[b][v + 1] == "["+playerData[playerNum][0]+"]" and gameBoard[b][v + 2] == "["+playerData[playerNum][0]+"]":
noLine(playerNum)
return
except:
if gameBoard[b][v - 1] == "["+playerData[playerNum][0]+"]" and gameBoard[b][v - 2] == "["+playerData[playerNum][0]+"]":
noLine(playerNum)
returnThe code works fine, it just doesn't seem very elegant.
try:
if gameBoard[b + 1][v] == "["+playerData[playerNum][0]+"]" and gameBoard[b + 2][v] == "["+playerData[playerNum][0]+"]":
noLine(playerNum)
return
elif gameBoard[b][v + 1] == "["+playerData[playerNum][0]+"]" and gameBoard[b][v + 2] == "["+playerData[playerNum][0]+"]":
noLine(playerNum)
return
elif gameBoard[b - 1][v] == "["+playerData[playerNum][0]+"]" and gameBoard[b - 2][v] == "["+playerData[playerNum][0]+"]":
noLine(playerNum)
return
elif gameBoard[b][v - 1] == "["+playerData[playerNum][0]+"]" and gameBoard[b][v - 2] == "["+playerData[playerNum][0]+"]":
noLine(playerNum)
return
except:
try:
if gameBoard[b + 1][v] == "["+playerData[playerNum][0]+"]" and gameBoard[b + 2][v] == "["+playerData[playerNum][0]+"]":
noLine(playerNum)
return
except:
if gameBoard[b - 1][v] == "["+playerData[playerNum][0]+"]" and gameBoard[b - 2][v] == "["+playerData[playerNum][0]+"]":
noLine(playerNum)
return
try:
if gameBoard[b][v + 1] == "["+playerData[playerNum][0]+"]" and gameBoard[b][v + 2] == "["+playerData[playerNum][0]+"]":
noLine(playerNum)
return
except:
if gameBoard[b][v - 1] == "["+playerData[playerNum][0]+"]" and gameBoard[b][v - 2] == "["+playerData[playerNum][0]+"]":
noLine(playerNum)
returntry:
if gameBoard[b + 1][v] == "["+playerData[playerNum][0]+"]" and gameBoard[b + 2][v] == "["+playerData[playerNum][0]+"]":
noLine(playerNum)
return
elif gameBoard[b][v + 1] == "["+playerData[playerNum][0]+"]" and gameBoard[b][v + 2] == "["+playerData[playerNum][0]+"]":
noLine(playerNum)
return
elif gameBoard[b - 1][v] == "["+playerData[playerNum][0]+"]" and gameBoard[b - 2][v] == "["+playerData[playerNum][0]+"]":
noLine(playerNum)
return
elif gameBoard[b][v - 1] == "["+playerData[playerNum][0]+"]" and gameBoard[b][v - 2] == "["+playerData[playerNum][0]+"]":
noLine(playerNum)
return
except:
try:
if gameBoard[b + 1][v] == "["+playerData[playerNum][0]+"]" and gameBoard[b + 2][v] == "["+playerData[playerNum][0]+"]":
noLine(playerNum)
return
except:
if gameBoard[b - 1][v] == "["+playerData[playerNum][0]+"]" and gameBoard[b - 2][v] == "["+playerData[playerNum][0]+"]":
noLine(playerNum)
return
try:
if gameBoard[b][v + 1] == "["+playerData[playerNum][0]+"]" and gameBoard[b][v + 2] == "["+playerData[playerNum][0]+"]":
noLine(playerNum)
return
except:
if gameBoard[b][v - 1] == "["+playerData[playerNum][0]+"]" and gameBoard[b][v - 2] == "["+playerData[playerNum][0]+"]":
noLine(playerNum)
returnpython python-3.x compression
python python-3.x compression
asked 11 mins ago
WimpyLlamaWimpyLlama
1
New contributor
WimpyLlama is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked 11 mins ago
WimpyLlamaWimpyLlama
1
New contributor
WimpyLlama is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked 11 mins ago
WimpyLlamaWimpyLlama
1
New contributor
WimpyLlama is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked 11 mins ago
WimpyLlamaWimpyLlama
1
asked 11 mins ago
WimpyLlamaWimpyLlama
1
1
New contributor
WimpyLlama is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
WimpyLlama is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
WimpyLlama 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 |
add a comment |
0
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',
autoActivateHeartbeat: false,
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
});
}
});
WimpyLlama 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%2f213426%2fis-there-a-way-to-compress-this%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
WimpyLlama is a new contributor. Be nice, and check out our Code of Conduct.
draft saved
draft discarded
WimpyLlama is a new contributor. Be nice, and check out our Code of Conduct.
WimpyLlama is a new contributor. Be nice, and check out our Code of Conduct.
WimpyLlama 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.
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%2f213426%2fis-there-a-way-to-compress-this%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
