I\'m doing a code in C++, to solve a maze problem.I need to solve it in a manner

Question

I'm doing a code in C++, to solve a maze problem.I need to solve it in a manner that, in each crossroad, the program generate a thread to each path. Well, but I'm having a problem, I need to test the coodinates to know if it is a path or a wall. So, I create threads inside IF conditions. So, I'm having two problems.

1) I'm using Microsoft Visual Studio and when I create threads, inside IF conditions or not, I have the following error:  

Error   C2893   Failed to specialize function template 'unknown-type std::invoke(_Callable &&,_Types &&...)'   labirinto   c:program files (x86)microsoft visual studio 14.0cinclude hrxthread   238

2) If I create thread inside the IF conditions, I can't acess the thread actions like join(), because it will be out of scope. And I nedd to join() only after to teste all conditions.

OBS: I'm doing it inside a object method that I called explorator and the method is explore(). So, inside explore() function I have:

thread Q(explore(maze));

It is a thread creation of a thread Q to run the method explore() passing maze as argument.

I included <thread.h> at the beginning of the explorator.cpp. Everything compile fine if don't create threads. Something that Isaid here was wrong ?

Explanation / Answer

#include <iostream>
using std::endl;
using std::cout;
using std::cin;
#include <string>
using std::string;
#include<Windows.h>
#include<conio.h>
void welcome();
char getKeyPress();
void printLevel(int);
void setMe(int);
bool isExit(int, int, int);
bool isWall(int, int, int);
int getPos(int, int&);
int getX(int, int &);
void update(int, int, int);
void makeSpace(int, int, int);
const char space = ' ';
const char me = '@';
char lvl1[15][15] = { { '#', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#' },
                    { 'X', ' ', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#' },
                    { '#', ' ', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#' },
                    { '#', ' ', ' ', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#' },
                    { '#', '#', ' ', ' ', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#' },
                    { '#', '#', '#', ' ', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#' },
                    { '#', '#', '#', ' ', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#' },
                    { '#', '#', '#', ' ', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#' },
                    { '#', '#', '#', ' ', '#', '#', '#', '#', '#', ' ', ' ', ' ', ' ', ' ', 'O' },
                    { '#', '#', '#', ' ', '#', '#', '#', '#', '#', ' ', '#', '#', '#', '#', '#' },
                    { '#', '#', '#', ' ', ' ', ' ', '#', '#', '#', ' ', '#', '#', '#', '#', '#' },
                    { '#', '#', '#', '#', '#', ' ', '#', '#', '#', ' ', '#', '#', '#', '#', '#' },
                    { '#', '#', '#', '#', '#', ' ', '#', '#', '#', ' ', '#', '#', '#', '#', '#' },
                    { '#', '#', '#', '#', '#', ' ', ' ', ' ', ' ', ' ', '#', '#', '#', '#', '#' },
                    { '#', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#' } };

char lvl2[15][15] = { { '#', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#' },
                    { '#', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#' },
                    { '#', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#' },
                    { '#', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#' },
                    { '#', ' ', ' ', ' ', ' ', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#' },
                    { '#', ' ', '#', '#', ' ', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#' },
                    { '#', ' ', '#', '#', ' ', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#' },
                    { '#', ' ', ' ', '#', ' ', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#' },
                    { '#', '#', ' ', '#', ' ', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#' },
                    { '#', '#', ' ', '#', ' ', '#', '#', '#', '#', '#', '#', '#', '#', ' ', 'O' },
                    { '#', '#', ' ', '#', ' ', '#', '#', '#', '#', '#', '#', '#', '#', ' ', '#' },
                    { '#', '#', ' ', '#', ' ', '#', '#', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '#' },
                    { '#', '#', ' ', '#', ' ', '#', ' ', ' ', '#', '#', '#', '#', '#', '#', '#' },
                    { 'X', ' ', ' ', '#', ' ', ' ', ' ', '#', '#', '#', '#', '#', '#', '#', '#' },
                    { '#', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#' } };
int main(void)
{
welcome();
begin:
system("CLS");
cout << "     ";
cout << "PLEASE SELECT A LEVEL     1---2---3---4---5---6     ";
int lvl;
cin >> lvl;
if (lvl != 2 && lvl != 1 && lvl > 0){
cout << endl << endl;
cout << " ";
cout << "Level not available yet, please check back later." << endl;
Sleep(1000);
goto begin;
}
system("CLS");
setMe(lvl);
printLevel(lvl);
int x, y;
while (1)
{
char move = getKeyPress();
switch (move)
{
case 'u':
x = getPos(lvl, y);
if (!isWall(x - 1, y, lvl))
{
if (isExit(x - 1, y, lvl))
{
system("CLS");
cout << "You Win!" << endl;
Sleep(2000);
goto begin;;
}
system("CLS");
makeSpace(lvl, x, y);
update(lvl, x - 1, y);
}
break;
case 'd':
x = getPos(lvl, y);
if (!isWall(x + 1, y, lvl))
{
if (isExit(x + 1, y, lvl))
{
system("CLS");
cout << "You Win!" << endl;
Sleep(2000);
goto begin;;
}
system("CLS");
makeSpace(lvl, x, y);
update(lvl, x + 1, y);
}
break;
case 'l':
x = getPos(lvl, y);
if (!isWall(x, y - 1, lvl))
{
if (isExit(x, y - 1, lvl))
{
system("CLS");
cout << "You Win!" << endl;
Sleep(2000);
goto begin;;
}
system("CLS");
makeSpace(lvl, x, y);
update(lvl, x, y - 1);
}
break;
case 'r':
x = getPos(lvl, y);
if (!isWall(x, y + 1, lvl))
{
if (isExit(x, y + 1, lvl)){
system("CLS");
cout << "You Win!" << endl;
Sleep(2000);
goto begin;;
}
system("CLS");
makeSpace(lvl, x, y);
update(lvl, x, y + 1);
}
break;
default:
break;
}
}
return 0;
}
void welcome()
{
string start = "WELCOME TO MAZE RUNNER v1.0";
string indev = "Currently in development, only two levels available.";
string howto = "Use the arrow keys and traverse through the maze. Exit is marked 'O'.";
cout << endl;
cout << "     ";
for (auto ch : start)
{
cout << ch;
Sleep(40);
}
cout << endl << endl;
cout << "       ";
for (auto ch : indev)
{
cout << ch;
Sleep(40);
}
cout << endl << endl << endl;
cout << " ";
for (auto ch : howto)
{
cout << ch;
Sleep(40);
}
Sleep(1500);
}
void printLevel(int lvl)
{
cout << " ";
if (lvl == 1)
{
for (int i = 0; i != 15; ++i)
{
cout << endl << " ";
for (int j = 0; j != 15; ++j){
cout << lvl1[i][j];
}
}
cout << endl;
}
if (lvl == 2)
{
for (int i = 0; i != 15; ++i)
{
cout << endl << " ";
for (int j = 0; j != 15; ++j)
{
cout << lvl2[i][j];
}
}
cout << endl;
}
}
void setMe(int lvl)
{
int x, y;
if (lvl == 1)
{
x = getX(lvl, y);
lvl1[x][y] = me;
}
if (lvl == 2)
{
x = getX(lvl, y);
lvl2[x][y] = me;
}
}
char getKeyPress()
{
char key = 127;
key = _getch();
if (key == 0 || key == -32)
{
key = _getch();
if (key == 72)
{
key = 'u';
}
else if (key == 75)
{
key = 'l';
}
else if (key == 77)
{
key = 'r';
}
else if (key == 80)
{
key = 'd';
}
}
return key;
}
bool isExit(int x, int y, int lvl)
{
if (lvl == 1)
{
if (lvl1[x][y] == 'O')
{
return true;
}
else
{
return false;
}
}
if (lvl == 2)
{
if (lvl2[x][y] == 'O')
{
return true;
}
else
{
return false;
}
}
return true;
}
int getPos(int lvl, int &y)
{
int xCoord;
if (lvl == 1)
{
for (int i = 0; i != 15; ++i)
{
for (int j = 0; j != 15; ++j)
{
if (lvl1[i][j] == '@')
{
xCoord = i;
y = j;
return xCoord;
}
}
}
}
if (lvl == 2)
{
for (int i = 0; i != 15; ++i)
{
for (int j = 0; j != 15; ++j)
{
if (lvl2[i][j] == '@')
{
xCoord = i;
y = j;
return xCoord;
}
}
}
}
return 0;
}
bool isWall(int x, int y, int lvl)
{
if (lvl == 1)
{
if (lvl1[x][y] == '#')
{
cout << " Cannot move! That is a wall / boundary.";
Sleep(400);
system("CLS");
printLevel(lvl);
return true;
}
else
{
return false;
}
}
if (lvl == 2)
{
if (lvl2[x][y] == '#')
{
cout << " Cannot move! That is a wall / boundary.";
Sleep(400);
system("CLS");
printLevel(lvl);
return true;
}
else
{
return false;
}
}
return true;
}
int getX(int lvl, int &y)
{
int xCoord;
if (lvl == 1)
{
for (int i = 0; i != 15; ++i)
{
for (int j = 0; j != 15; ++j)
{
if (lvl1[i][j] == 'X')
{
xCoord = i;
y = j;
return xCoord;
}
}
}
}
if (lvl == 2)
{
for (int i = 0; i != 15; ++i)
{
for (int j = 0; j != 15; ++j)
{
if (lvl2[i][j] == 'X')
{
xCoord = i;
y = j;
return xCoord;
}
}
}
}
return 0;
}
void update(int lvl, int x, int y)
{
if (lvl == 1)
{
lvl1[x][y] = me;
printLevel(lvl);
}
if (lvl == 2)
{
lvl2[x][y] = me;
printLevel(lvl);
}
}
void makeSpace(int lvl, int x, int y)
{
if (lvl == 1)
{
lvl1[x][y] = space;
}
if (lvl == 2)
{
lvl2[x][y] = space;
}
}

Related Questions

Navigate

• Browse (All)
• Browse I
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.