Tic Tac Toe in C++11
0
I wrote this,but I want to add some sort of AI, could you guys give me any pointers? (Ha, get it?).I would also be happy to hear what you have to say about the code. Also is it neat (aesthetically as well as functionally)?
#include <iostream>
bool end = false;
int w_combinations[8][3] = {{0,1,2},{3,4,5},{6,7,8},{0,3,6},{1,4,7},{2,5,8},{0,4,8},{2,4,6}};
int pos = {1,2,3,4,5,6,7,8,9};
void check (int x) {
if ( x == 10) {
std::cout << "X|";
}
else if (x == 11) {
std::cout << "O|";
}
else {
std::cout << x << "|";
}
}
void printMatrix() {
std::cout << "|" ; check(pos[0]) ; check(pos[1]) ; check(pos[2]);std::cout << "n";
std::cout << "|" ; check(pos[3]);check(pos[4]) ; check(pos[5]);std::cout << "n";
std::cout << "|" ; check(pos[6]) ; check(pos[7]) ; check(pos[8]); std::cout << "n";
}
void input(int z , int player) {
if (player == 1 && pos[z-1] != 10 && pos[z-1] != 11) {
pos[z-1] = 10;
}
else if (player == 2 && pos[z-1] != 10 && pos[z-1] != 11){
pos[z-1] = 11;
}
else {
std::cout << "nInvalid! Try again: ";
int y;
std::cin >> y;
input(y,player);
}
}
//Winning mechanism: Simply cylce through all combos.
bool win() {
for (int i = 0 ; i < 8 ; ++i) {
if (pos[w_combinations[i][0]] == pos[w_combinations[i][1]] && pos[w_combinations[i][0]] == pos[w_combinations[i][2]])
{
return true;
break;
}
}
return false;
}
int main() {
int count = 0; //Cycle through draws
while (1)
{
int z;
printMatrix();
std::cout << "1[X]:";
std::cin >> z;
input(z,1);
if (win()) {std::cout << "Player 1 wins!n";break;}
++count;
printMatrix();
if (count == 9) {
std::cout << "Draw!";
break;
}
std::cout << "2[O]:";
std::cin >> z;
input(z,2);
if (win()) {std::cout << "Player 2 wins!n";break;}
++count;
if (count == 9) {
std::cout << "Draw!";
break;
}
}
std::cout << "Play again[Yes = 1, No = 0]: ";
int permission;
std::cin >> permission;
if (permission == 1) {
std::cout << "nn";
main();
}
}
c++
asked 5 mins ago
Chirag M
413
add a comment |
0
I wrote this,but I want to add some sort of AI, could you guys give me any pointers? (Ha, get it?).I would also be happy to hear what you have to say about the code. Also is it neat (aesthetically as well as functionally)?
#include <iostream>
bool end = false;
int w_combinations[8][3] = {{0,1,2},{3,4,5},{6,7,8},{0,3,6},{1,4,7},{2,5,8},{0,4,8},{2,4,6}};
int pos = {1,2,3,4,5,6,7,8,9};
void check (int x) {
if ( x == 10) {
std::cout << "X|";
}
else if (x == 11) {
std::cout << "O|";
}
else {
std::cout << x << "|";
}
}
void printMatrix() {
std::cout << "|" ; check(pos[0]) ; check(pos[1]) ; check(pos[2]);std::cout << "n";
std::cout << "|" ; check(pos[3]);check(pos[4]) ; check(pos[5]);std::cout << "n";
std::cout << "|" ; check(pos[6]) ; check(pos[7]) ; check(pos[8]); std::cout << "n";
}
void input(int z , int player) {
if (player == 1 && pos[z-1] != 10 && pos[z-1] != 11) {
pos[z-1] = 10;
}
else if (player == 2 && pos[z-1] != 10 && pos[z-1] != 11){
pos[z-1] = 11;
}
else {
std::cout << "nInvalid! Try again: ";
int y;
std::cin >> y;
input(y,player);
}
}
//Winning mechanism: Simply cylce through all combos.
bool win() {
for (int i = 0 ; i < 8 ; ++i) {
if (pos[w_combinations[i][0]] == pos[w_combinations[i][1]] && pos[w_combinations[i][0]] == pos[w_combinations[i][2]])
{
return true;
break;
}
}
return false;
}
int main() {
int count = 0; //Cycle through draws
while (1)
{
int z;
printMatrix();
std::cout << "1[X]:";
std::cin >> z;
input(z,1);
if (win()) {std::cout << "Player 1 wins!n";break;}
++count;
printMatrix();
if (count == 9) {
std::cout << "Draw!";
break;
}
std::cout << "2[O]:";
std::cin >> z;
input(z,2);
if (win()) {std::cout << "Player 2 wins!n";break;}
++count;
if (count == 9) {
std::cout << "Draw!";
break;
}
}
std::cout << "Play again[Yes = 1, No = 0]: ";
int permission;
std::cin >> permission;
if (permission == 1) {
std::cout << "nn";
main();
}
}
c++
asked 5 mins ago
Chirag M
413
add a comment |
0
0
0
I wrote this,but I want to add some sort of AI, could you guys give me any pointers? (Ha, get it?).I would also be happy to hear what you have to say about the code. Also is it neat (aesthetically as well as functionally)?
#include <iostream>
bool end = false;
int w_combinations[8][3] = {{0,1,2},{3,4,5},{6,7,8},{0,3,6},{1,4,7},{2,5,8},{0,4,8},{2,4,6}};
int pos = {1,2,3,4,5,6,7,8,9};
void check (int x) {
if ( x == 10) {
std::cout << "X|";
}
else if (x == 11) {
std::cout << "O|";
}
else {
std::cout << x << "|";
}
}
void printMatrix() {
std::cout << "|" ; check(pos[0]) ; check(pos[1]) ; check(pos[2]);std::cout << "n";
std::cout << "|" ; check(pos[3]);check(pos[4]) ; check(pos[5]);std::cout << "n";
std::cout << "|" ; check(pos[6]) ; check(pos[7]) ; check(pos[8]); std::cout << "n";
}
void input(int z , int player) {
if (player == 1 && pos[z-1] != 10 && pos[z-1] != 11) {
pos[z-1] = 10;
}
else if (player == 2 && pos[z-1] != 10 && pos[z-1] != 11){
pos[z-1] = 11;
}
else {
std::cout << "nInvalid! Try again: ";
int y;
std::cin >> y;
input(y,player);
}
}
//Winning mechanism: Simply cylce through all combos.
bool win() {
for (int i = 0 ; i < 8 ; ++i) {
if (pos[w_combinations[i][0]] == pos[w_combinations[i][1]] && pos[w_combinations[i][0]] == pos[w_combinations[i][2]])
{
return true;
break;
}
}
return false;
}
int main() {
int count = 0; //Cycle through draws
while (1)
{
int z;
printMatrix();
std::cout << "1[X]:";
std::cin >> z;
input(z,1);
if (win()) {std::cout << "Player 1 wins!n";break;}
++count;
printMatrix();
if (count == 9) {
std::cout << "Draw!";
break;
}
std::cout << "2[O]:";
std::cin >> z;
input(z,2);
if (win()) {std::cout << "Player 2 wins!n";break;}
++count;
if (count == 9) {
std::cout << "Draw!";
break;
}
}
std::cout << "Play again[Yes = 1, No = 0]: ";
int permission;
std::cin >> permission;
if (permission == 1) {
std::cout << "nn";
main();
}
}
c++
asked 5 mins ago
Chirag M
413
I wrote this,but I want to add some sort of AI, could you guys give me any pointers? (Ha, get it?).I would also be happy to hear what you have to say about the code. Also is it neat (aesthetically as well as functionally)?
#include <iostream>
bool end = false;
int w_combinations[8][3] = {{0,1,2},{3,4,5},{6,7,8},{0,3,6},{1,4,7},{2,5,8},{0,4,8},{2,4,6}};
int pos = {1,2,3,4,5,6,7,8,9};
void check (int x) {
if ( x == 10) {
std::cout << "X|";
}
else if (x == 11) {
std::cout << "O|";
}
else {
std::cout << x << "|";
}
}
void printMatrix() {
std::cout << "|" ; check(pos[0]) ; check(pos[1]) ; check(pos[2]);std::cout << "n";
std::cout << "|" ; check(pos[3]);check(pos[4]) ; check(pos[5]);std::cout << "n";
std::cout << "|" ; check(pos[6]) ; check(pos[7]) ; check(pos[8]); std::cout << "n";
}
void input(int z , int player) {
if (player == 1 && pos[z-1] != 10 && pos[z-1] != 11) {
pos[z-1] = 10;
}
else if (player == 2 && pos[z-1] != 10 && pos[z-1] != 11){
pos[z-1] = 11;
}
else {
std::cout << "nInvalid! Try again: ";
int y;
std::cin >> y;
input(y,player);
}
}
//Winning mechanism: Simply cylce through all combos.
bool win() {
for (int i = 0 ; i < 8 ; ++i) {
if (pos[w_combinations[i][0]] == pos[w_combinations[i][1]] && pos[w_combinations[i][0]] == pos[w_combinations[i][2]])
{
return true;
break;
}
}
return false;
}
int main() {
int count = 0; //Cycle through draws
while (1)
{
int z;
printMatrix();
std::cout << "1[X]:";
std::cin >> z;
input(z,1);
if (win()) {std::cout << "Player 1 wins!n";break;}
++count;
printMatrix();
if (count == 9) {
std::cout << "Draw!";
break;
}
std::cout << "2[O]:";
std::cin >> z;
input(z,2);
if (win()) {std::cout << "Player 2 wins!n";break;}
++count;
if (count == 9) {
std::cout << "Draw!";
break;
}
}
std::cout << "Play again[Yes = 1, No = 0]: ";
int permission;
std::cin >> permission;
if (permission == 1) {
std::cout << "nn";
main();
}
}
c++
c++
asked 5 mins ago
Chirag M
413
asked 5 mins ago
Chirag M
413
asked 5 mins ago
Chirag M
413
asked 5 mins ago
Chirag M
413
asked 5 mins ago
Chirag M
413
413
add a comment |
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',
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
});
}
});
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%2f210679%2ftic-tac-toe-in-c11%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
draft saved
draft discarded
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%2f210679%2ftic-tac-toe-in-c11%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
