organ
/
Sanmill
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

perfect: Format code with vscode

This commit is contained in:
Calcitem 2021-01-20 01:33:20 +08:00
parent 50b9574101
commit 5c71717a9c
27 changed files with 4194 additions and 2817 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

75
src/perfect/bufferedFile.cpp
View File

@ -27,7 +27,8 @@ BufferedFile::BufferedFile(unsigned int numberOfThreads, unsigned int bufferSize
bytesInReadBuffer = new unsigned int[numThreads];
bytesInWriteBuffer = new unsigned int[numThreads];
for (curThread = 0; curThread < numThreads; curThread++) {
for (curThread = 0; curThread < numThreads; curThread++)
{
curReadingPointer[curThread] = 0;
curWritingPointer[curThread] = 0;
bytesInReadBuffer[curThread] = 0;
@ -39,7 +40,8 @@ BufferedFile::BufferedFile(unsigned int numberOfThreads, unsigned int bufferSize
hFile = CreateFileA(fileName, GENERIC_READ | GENERIC_WRITE, 0, nullptr, OPEN_ALWAYS, FILE_ATTRIBUTE_NORMAL, nullptr);
// opened file succesfully
if (hFile == INVALID_HANDLE_VALUE) {
if (hFile == INVALID_HANDLE_VALUE)
{
hFile = nullptr;
return;
}
@ -67,7 +69,8 @@ BufferedFile::~BufferedFile()
delete[] bytesInWriteBuffer;
// close file
if (hFile != nullptr) CloseHandle(hFile);
if (hFile != nullptr)
CloseHandle(hFile);
}
//-----------------------------------------------------------------------------
@ -88,7 +91,8 @@ long long BufferedFile::getFileSize()
//-----------------------------------------------------------------------------
bool BufferedFile::flushBuffers()
{
for (unsigned int threadNo = 0; threadNo < numThreads; threadNo++) {
for (unsigned int threadNo = 0; threadNo < numThreads; threadNo++)
{
writeDataToFile(hFile, curWritingPointer[threadNo] - bytesInWriteBuffer[threadNo], bytesInWriteBuffer[threadNo], &writeBuffer[threadNo * bufferSize + 0]);
bytesInWriteBuffer[threadNo] = 0;
}
@ -108,14 +112,23 @@ void BufferedFile::writeDataToFile(HANDLE hFile, long long offset, unsigned int
liDistanceToMove.QuadPart = offset;
EnterCriticalSection(&csIO);
while (!SetFilePointerEx(hFile, liDistanceToMove, nullptr, FILE_BEGIN)) cout << endl << "SetFilePointerEx failed!";
while (restingBytes > 0) {
if (WriteFile(hFile, pData, sizeInBytes, &dwBytesWritten, nullptr) == TRUE) {
while (!SetFilePointerEx(hFile, liDistanceToMove, nullptr, FILE_BEGIN))
cout << endl
<< "SetFilePointerEx failed!";
while (restingBytes > 0)
{
if (WriteFile(hFile, pData, sizeInBytes, &dwBytesWritten, nullptr) == TRUE)
{
restingBytes -= dwBytesWritten;
pData = (void *)(((unsigned char *)pData) + dwBytesWritten);
if (restingBytes > 0) cout << endl << "Still " << restingBytes << " to write!";
} else {
cout << endl << "WriteFile Failed!";
if (restingBytes > 0)
cout << endl
<< "Still " << restingBytes << " to write!";
}
else
{
cout << endl
<< "WriteFile Failed!";
}
}
LeaveCriticalSection(&csIO);
@ -134,14 +147,23 @@ void BufferedFile::readDataFromFile(HANDLE hFile, long long offset, unsigned int
liDistanceToMove.QuadPart = offset;
EnterCriticalSection(&csIO);
while (!SetFilePointerEx(hFile, liDistanceToMove, nullptr, FILE_BEGIN)) cout << endl << "SetFilePointerEx failed!";
while (restingBytes > 0) {
if (ReadFile(hFile, pData, sizeInBytes, &dwBytesRead, nullptr) == TRUE) {
while (!SetFilePointerEx(hFile, liDistanceToMove, nullptr, FILE_BEGIN))
cout << endl
<< "SetFilePointerEx failed!";
while (restingBytes > 0)
{
if (ReadFile(hFile, pData, sizeInBytes, &dwBytesRead, nullptr) == TRUE)
{
restingBytes -= dwBytesRead;
pData = (void *)(((unsigned char *)pData) + dwBytesRead);
if (restingBytes > 0) cout << endl << "Still " << restingBytes << " to read!";
} else {
cout << endl << "ReadFile Failed!";
if (restingBytes > 0)
cout << endl
<< "Still " << restingBytes << " to read!";
}
else
{
cout << endl
<< "ReadFile Failed!";
}
}
LeaveCriticalSection(&csIO);
@ -163,13 +185,16 @@ bool BufferedFile::writeBytes(unsigned int numBytes, unsigned char *pData)
bool BufferedFile::writeBytes(unsigned int threadNo, long long positionInFile, unsigned int numBytes, unsigned char *pData)
{
// parameters ok?
if (threadNo >= numThreads) return false;
if (pData == nullptr) return false;
if (threadNo >= numThreads)
return false;
if (pData == nullptr)
return false;
// locals
// if buffer full or not sequential write operation write buffer to file
if (bytesInWriteBuffer[threadNo] && (positionInFile != curWritingPointer[threadNo] || bytesInWriteBuffer[threadNo] + numBytes >= bufferSize)) {
if (bytesInWriteBuffer[threadNo] && (positionInFile != curWritingPointer[threadNo] || bytesInWriteBuffer[threadNo] + numBytes >= bufferSize))
{
writeDataToFile(hFile, curWritingPointer[threadNo] - bytesInWriteBuffer[threadNo], bytesInWriteBuffer[threadNo], &writeBuffer[threadNo * bufferSize + 0]);
bytesInWriteBuffer[threadNo] = 0;
@ -200,13 +225,17 @@ bool BufferedFile::readBytes(unsigned int numBytes, unsigned char *pData)
bool BufferedFile::readBytes(unsigned int threadNo, long long positionInFile, unsigned int numBytes, unsigned char *pData)
{
// parameters ok?
if (threadNo >= numThreads) return false;
if (pData == nullptr) return false;
if (threadNo >= numThreads)
return false;
if (pData == nullptr)
return false;
// read from file into buffer if not enough data in buffer or if it is not an sequential reading operation?
if (positionInFile != curReadingPointer[threadNo] || bytesInReadBuffer[threadNo] < numBytes) {
if (positionInFile != curReadingPointer[threadNo] || bytesInReadBuffer[threadNo] < numBytes)
{
bytesInReadBuffer[threadNo] = ((positionInFile + bufferSize <= fileSize) ? bufferSize : (unsigned int)(fileSize - positionInFile));
if (bytesInReadBuffer[threadNo] < numBytes) return false;
if (bytesInReadBuffer[threadNo] < numBytes)
return false;
readDataFromFile(hFile, positionInFile, bytesInReadBuffer[threadNo], &readBuffer[threadNo * bufferSize + bufferSize - bytesInReadBuffer[threadNo]]);
}
memcpy(pData, &readBuffer[threadNo * bufferSize + bufferSize - bytesInReadBuffer[threadNo]], numBytes);

1
src/perfect/config.h
View File

@ -6,7 +6,6 @@
https://github.com/madweasel/madweasels-cpp
\*********************************************************************/
#ifndef CONFIG_H
#define CONFIG_H

136
src/perfect/cyclicArray.cpp
View File

@ -11,7 +11,7 @@
//-----------------------------------------------------------------------------
// Name: CyclicArray()
// Desc: Creates a cyclic array. The passed file is used as temporary data buffer for the cyclic array.
//-----------------------------------------------------------------------------
//-----------------------------F------------------------------------------------
CyclicArray::CyclicArray(unsigned int blockSizeInBytes, unsigned int numberOfBlocks, const char *fileName)
{
// Init blocks
@ -29,7 +29,8 @@ CyclicArray::CyclicArray(unsigned int blockSizeInBytes, unsigned int numberOfBlo
hFile = CreateFileA(fileName, GENERIC_READ | GENERIC_WRITE, FILE_SHARE_READ | FILE_SHARE_WRITE, nullptr, OPEN_ALWAYS, FILE_ATTRIBUTE_NORMAL, nullptr);
// opened file succesfully
if (hFile == INVALID_HANDLE_VALUE) {
if (hFile == INVALID_HANDLE_VALUE)
{
hFile = nullptr;
return;
}
@ -46,7 +47,8 @@ CyclicArray::~CyclicArray()
delete[] writingBlock;
// close file
if (hFile != nullptr) CloseHandle(hFile);
if (hFile != nullptr)
CloseHandle(hFile);
}
//-----------------------------------------------------------------------------
@ -61,15 +63,24 @@ void CyclicArray::writeDataToFile(HANDLE hFile, long long offset, unsigned int s
liDistanceToMove.QuadPart = offset;
while (!SetFilePointerEx(hFile, liDistanceToMove, nullptr, FILE_BEGIN)) cout << endl << "SetFilePointerEx failed!";
while (!SetFilePointerEx(hFile, liDistanceToMove, nullptr, FILE_BEGIN))
cout << endl
<< "SetFilePointerEx failed!";
while (restingBytes > 0) {
if (WriteFile(hFile, pData, sizeInBytes, &dwBytesWritten, nullptr) == TRUE) {
while (restingBytes > 0)
{
if (WriteFile(hFile, pData, sizeInBytes, &dwBytesWritten, nullptr) == TRUE)
{
restingBytes -= dwBytesWritten;
pData = (void *)(((unsigned char *)pData) + dwBytesWritten);
if (restingBytes > 0) cout << endl << "Still " << restingBytes << " to write!";
} else {
cout << endl << "WriteFile Failed!";
if (restingBytes > 0)
cout << endl
<< "Still " << restingBytes << " to write!";
}
else
{
cout << endl
<< "WriteFile Failed!";
}
}
}
@ -86,15 +97,24 @@ void CyclicArray::readDataFromFile(HANDLE hFile, long long offset, unsigned int
liDistanceToMove.QuadPart = offset;
while (!SetFilePointerEx(hFile, liDistanceToMove, nullptr, FILE_BEGIN)) cout << endl << "SetFilePointerEx failed!";
while (!SetFilePointerEx(hFile, liDistanceToMove, nullptr, FILE_BEGIN))
cout << endl
<< "SetFilePointerEx failed!";
while (restingBytes > 0) {
if (ReadFile(hFile, pData, sizeInBytes, &dwBytesRead, nullptr) == TRUE) {
while (restingBytes > 0)
{
if (ReadFile(hFile, pData, sizeInBytes, &dwBytesRead, nullptr) == TRUE)
{
restingBytes -= dwBytesRead;
pData = (void *)(((unsigned char *)pData) + dwBytesRead);
if (restingBytes > 0) cout << endl << "Still " << restingBytes << " to read!";
} else {
cout << endl << "ReadFile Failed!";
if (restingBytes > 0)
cout << endl
<< "Still " << restingBytes << " to read!";
}
else
{
cout << endl
<< "ReadFile Failed!";
}
}
}
@ -110,7 +130,8 @@ bool CyclicArray::addBytes(unsigned int numBytes, unsigned char *pData)
unsigned int bytesWritten = 0;
// write each byte
while (bytesWritten < numBytes) {
while (bytesWritten < numBytes)
{
// store byte in current reading block
*curWritingPointer = *pData;
@ -119,16 +140,19 @@ bool CyclicArray::addBytes(unsigned int numBytes, unsigned char *pData)
pData++;
// when block is full then save current one to file and begin new one
if (curWritingPointer == writingBlock + blockSize) {
if (curWritingPointer == writingBlock + blockSize)
{
// copy data into reading block?
if (curReadingBlock == curWritingBlock) {
if (curReadingBlock == curWritingBlock)
{
memcpy(readingBlock, writingBlock, blockSize);
curReadingPointer = readingBlock + (curReadingPointer - writingBlock);
}
// will reading block be overwritten?
if (curReadingBlock == curWritingBlock && !readWriteInSameRound) return false;
if (curReadingBlock == curWritingBlock && !readWriteInSameRound)
return false;
// store bock in file
writeDataToFile(hFile, ((long long)blockSize) * ((long long)curWritingBlock), blockSize, writingBlock);
@ -136,7 +160,8 @@ bool CyclicArray::addBytes(unsigned int numBytes, unsigned char *pData)
// set pointer to beginnig of writing block
curWritingPointer = writingBlock;
curWritingBlock = (curWritingBlock + 1) % numBlocks;
if (curWritingBlock == 0) readWriteInSameRound = false;
if (curWritingBlock == 0)
readWriteInSameRound = false;
}
}
@ -150,8 +175,10 @@ bool CyclicArray::addBytes(unsigned int numBytes, unsigned char *pData)
//-----------------------------------------------------------------------------
bool CyclicArray::bytesAvailable()
{
if (curReadingBlock == curWritingBlock && curReadingPointer == curWritingPointer && readWriteInSameRound) return false;
else return true;
if (curReadingBlock == curWritingBlock && curReadingPointer == curWritingPointer && readWriteInSameRound)
return false;
else
return true;
}
//-----------------------------------------------------------------------------
@ -165,10 +192,12 @@ bool CyclicArray::takeBytes(unsigned int numBytes, unsigned char *pData)
unsigned int bytesRead = 0;
// read each byte
while (bytesRead < numBytes) {
while (bytesRead < numBytes)
{
// was current reading byte already written ?
if (curReadingBlock == curWritingBlock && curReadingPointer == curWritingPointer && readWriteInSameRound) return false;
if (curReadingBlock == curWritingBlock && curReadingPointer == curWritingPointer && readWriteInSameRound)
return false;
// read current byte
*pData = *curReadingPointer;
@ -177,17 +206,21 @@ bool CyclicArray::takeBytes(unsigned int numBytes, unsigned char *pData)
pData++;
// load next block?
if (curReadingPointer == readingBlock + blockSize) {
if (curReadingPointer == readingBlock + blockSize)
{
// go to next block
curReadingBlock = (curReadingBlock + 1) % numBlocks;
if (curReadingBlock == 0) readWriteInSameRound = true;
if (curReadingBlock == 0)
readWriteInSameRound = true;
// writing block reached ?
if (curReadingBlock == curWritingBlock) {
if (curReadingBlock == curWritingBlock)
{
curReadingPointer = writingBlock;
} else {
}
else
{
// set pointer to beginnig of reading block
curReadingPointer = readingBlock;
@ -221,20 +254,23 @@ bool CyclicArray::loadFile(const char *fileName, LONGLONG &numBytesLoaded)
numBytesLoaded = 0;
// cyclic array file must be open
if (hFile == nullptr) return false;
if (hFile == nullptr)
return false;
// Open Database-File (FILE_FLAG_NO_BUFFERING | FILE_FLAG_WRITE_THROUGH | FILE_FLAG_RANDOM_ACCESS)
hLoadFile = CreateFileA(fileName, GENERIC_READ, FILE_SHARE_READ, nullptr, OPEN_EXISTING, FILE_ATTRIBUTE_NORMAL, nullptr);
// opened file succesfully
if (hLoadFile == INVALID_HANDLE_VALUE) {
if (hLoadFile == INVALID_HANDLE_VALUE)
{
return false;
}
// does data of file fit into cyclic array ?
GetFileSizeEx(hLoadFile, &largeInt);
if (maxFileSize < largeInt.QuadPart) {
if (maxFileSize < largeInt.QuadPart)
{
CloseHandle(hLoadFile);
return false;
}
@ -251,7 +287,8 @@ bool CyclicArray::loadFile(const char *fileName, LONGLONG &numBytesLoaded)
dataInFile = new unsigned char[blockSize];
//
for (curBlock = 0; curBlock < numBlocksInFile - 1; curBlock++, curOffset += blockSize) {
for (curBlock = 0; curBlock < numBlocksInFile - 1; curBlock++, curOffset += blockSize)
{
// load data from file
readDataFromFile(hLoadFile, curOffset, blockSize, dataInFile);
@ -288,7 +325,8 @@ bool CyclicArray::saveFile(const char *fileName)
void *pointer;
// cyclic array file must be open
if (hFile == nullptr) {
if (hFile == nullptr)
{
return false;
}
@ -296,7 +334,8 @@ bool CyclicArray::saveFile(const char *fileName)
hSaveFile = CreateFileA(fileName, GENERIC_WRITE, FILE_SHARE_WRITE, nullptr, OPEN_ALWAYS, FILE_ATTRIBUTE_NORMAL, nullptr);
// opened file succesfully
if (hSaveFile == INVALID_HANDLE_VALUE) {
if (hSaveFile == INVALID_HANDLE_VALUE)
{
return false;
}
@ -305,22 +344,27 @@ bool CyclicArray::saveFile(const char *fileName)
curBlock = curReadingBlock;
dataInFile = new unsigned char[blockSize];
do {
do
{
// copy current block
if (curBlock == curWritingBlock && curBlock == curReadingBlock) {
if (curBlock == curWritingBlock && curBlock == curReadingBlock)
{
pointer = curReadingPointer;
bytesToWrite = (unsigned int)(curWritingPointer - curReadingPointer);
} else if (curBlock == curWritingBlock) {
}
else if (curBlock == curWritingBlock)
{
pointer = writingBlock;
bytesToWrite = (unsigned int)(curWritingPointer - writingBlock);
} else if (curBlock == curReadingBlock) {
}
else if (curBlock == curReadingBlock)
{
pointer = curReadingPointer;
bytesToWrite = blockSize - (unsigned int)(curReadingPointer - readingBlock);
} else {
}
else
{
readDataFromFile(hFile, ((long long)curBlock) * ((long long)blockSize), blockSize, dataInFile);
pointer = dataInFile;
bytesToWrite = blockSize;
@ -331,8 +375,10 @@ bool CyclicArray::saveFile(const char *fileName)
curOffset += bytesToWrite;
// exit?
if (curBlock == curWritingBlock) break;
else curBlock = (curBlock + 1) % numBlocks;
if (curBlock == curWritingBlock)
break;
else
curBlock = (curBlock + 1) % numBlocks;
} while (true);

99
src/perfect/main.cpp
View File

@ -35,7 +35,8 @@ int main(void)
// intro
cout << "*************************" << endl;
cout << "* Muehle *" << endl;
cout << "*************************" << endl << endl;
cout << "*************************" << endl
<< endl;
ai->setDatabasePath(databaseDirectory);
@ -46,28 +47,40 @@ int main(void)
pos->beginNewGame(ai, ai, (rand() % 2) ? fieldStruct::playerOne : fieldStruct::playerTwo);
#endif // SELF_PLAY
if (calculateDatabase) {
if (calculateDatabase)
{
// calculate
ai->calculateDatabase(MAX_DEPTH_OF_TREE, false);
// test database
cout << endl << "Begin test starting from layer: "; startTestFromLayer;
cout << endl << "End test at layer: "; endTestAtLayer;
cout << endl
<< "Begin test starting from layer: ";
startTestFromLayer;
cout << endl
<< "End test at layer: ";
endTestAtLayer;
ai->testLayers(startTestFromLayer, endTestAtLayer);
} else {
}
else
{
#ifdef SELF_PLAY
int moveCount = 0;
#else
cout << "Is Player 1 human? (y/n):"; cin >> ch; if (ch[0] == 'y') playerOneHuman = true;
cout << "Is Player 2 human? (y/n):"; cin >> ch; if (ch[0] == 'y') playerTwoHuman = true;
cout << "Is Player 1 human? (y/n):";
cin >> ch;
if (ch[0] == 'y')
playerOneHuman = true;
cout << "Is Player 2 human? (y/n):";
cin >> ch;
if (ch[0] == 'y')
playerTwoHuman = true;
#endif // SELF_PLAY
// play
do {
do
{
// print board
cout << "\n\n\n\n\n\n\n\n\n\n\n";
pos->getComputersChoice(&pushFrom, &pushTo);
@ -76,7 +89,8 @@ int main(void)
#ifdef SELF_PLAY
moveCount++;
if (moveCount > 99) {
if (moveCount > 99)
{
goto out;
}
#endif // SELF_PLAY
@ -84,32 +98,49 @@ int main(void)
pos->printBoard();
// Human
if ((pos->getCurrentPlayer() == fieldStruct::playerOne && playerOneHuman)
|| (pos->getCurrentPlayer() == fieldStruct::playerTwo && playerTwoHuman)) {
do {
if ((pos->getCurrentPlayer() == fieldStruct::playerOne && playerOneHuman) || (pos->getCurrentPlayer() == fieldStruct::playerTwo && playerTwoHuman))
{
do
{
// Show text
if (pos->mustStoneBeRemoved()) cout << "\n Which stone do you want to remove? [a-x]: \n\n\n";
else if (pos->inSettingPhase()) cout << "\n Where are you going? [a-x]: \n\n\n";
else cout << "\n Your train? [a-x][a-x]: \n\n\n";
if (pos->mustStoneBeRemoved())
cout << "\n Which stone do you want to remove? [a-x]: \n\n\n";
else if (pos->inSettingPhase())
cout << "\n Where are you going? [a-x]: \n\n\n";
else
cout << "\n Your train? [a-x][a-x]: \n\n\n";
// get input
cin >> ch;
if ((ch[0] >= 'a') && (ch[0] <= 'x')) pushFrom = ch[0] - 'a'; else pushFrom = fieldStruct::size;
if ((ch[0] >= 'a') && (ch[0] <= 'x'))
pushFrom = ch[0] - 'a';
else
pushFrom = fieldStruct::size;
if (pos->inSettingPhase()) {
if ((ch[0] >= 'a') && (ch[0] <= 'x')) pushTo = ch[0] - 'a'; else pushTo = fieldStruct::size;
} else {
if ((ch[1] >= 'a') && (ch[1] <= 'x')) pushTo = ch[1] - 'a'; else pushTo = fieldStruct::size;
if (pos->inSettingPhase())
{
if ((ch[0] >= 'a') && (ch[0] <= 'x'))
pushTo = ch[0] - 'a';
else
pushTo = fieldStruct::size;
}
else
{
if ((ch[1] >= 'a') && (ch[1] <= 'x'))
pushTo = ch[1] - 'a';
else
pushTo = fieldStruct::size;
}
// undo
if (ch[0] == 'u' && ch[1] == 'n' && ch[2] == 'd' && ch[3] == 'o') {
if (ch[0] == 'u' && ch[1] == 'n' && ch[2] == 'd' && ch[3] == 'o')
{
// undo moves until a human player shall move
do {
do
{
pos->undo_move();
} while (!((pos->getCurrentPlayer() == fieldStruct::playerOne && playerOneHuman)
|| (pos->getCurrentPlayer() == fieldStruct::playerTwo && playerTwoHuman)));
} while (!((pos->getCurrentPlayer() == fieldStruct::playerOne && playerOneHuman) || (pos->getCurrentPlayer() == fieldStruct::playerTwo && playerTwoHuman)));
// reprint board
break;
@ -118,7 +149,9 @@ int main(void)
} while (pos->do_move(pushFrom, pushTo) == false);
// Computer
} else {
}
else
{
cout << "\n";
pos->do_move(pushFrom, pushTo);
}
@ -130,10 +163,14 @@ int main(void)
pos->printBoard();
if (pos->getWinner() == fieldStruct::playerOne) cout << "\n Player 1 (o) won after " << pos->getMovesDone() << " move.\n\n";
else if (pos->getWinner() == fieldStruct::playerTwo) cout << "\n Player 2 (x) won after " << pos->getMovesDone() << " move.\n\n";
else if (pos->getWinner() == fieldStruct::gameDrawn) cout << "\n Draw!\n\n";
else cout << "\n A program error has occurred!\n\n";
if (pos->getWinner() == fieldStruct::playerOne)
cout << "\n Player 1 (o) won after " << pos->getMovesDone() << " move.\n\n";
else if (pos->getWinner() == fieldStruct::playerTwo)
cout << "\n Player 2 (x) won after " << pos->getMovesDone() << " move.\n\n";
else if (pos->getWinner() == fieldStruct::gameDrawn)
cout << "\n Draw!\n\n";
else
cout << "\n A program error has occurred!\n\n";
}
out:

70
src/perfect/millAI.cpp
View File

@ -20,7 +20,8 @@ void fieldStruct::printBoard()
unsigned int index;
char c[fieldStruct::size];
for (index = 0; index < fieldStruct::size; index++) c[index] = GetCharFromStone(this->board[index]);
for (index = 0; index < fieldStruct::size; index++)
c[index] = GetCharFromStone(this->board[index]);
cout << "current player : " << GetCharFromStone(this->curPlayer->id) << " has " << this->curPlayer->numStones << " stones\n";
cout << "opponent player : " << GetCharFromStone(this->oppPlayer->id) << " has " << this->oppPlayer->numStones << " stones\n";
@ -28,17 +29,27 @@ void fieldStruct::printBoard()
cout << "setting phase : " << (this->settingPhase ? "true" : "false");
cout << "\n";
cout << "\n a-----b-----c " << c[0] << "-----" << c[1] << "-----" << c[2];
cout << "\n | | | " << "| | |";
cout << "\n | d---e---f | " << "| " << c[3] << "---" << c[4] << "---" << c[5] << " |";
cout << "\n | | | | | " << "| | | | |";
cout << "\n | | g-h-i | | " << "| | " << c[6] << "-" << c[7] << "-" << c[8] << " | |";
cout << "\n | | | | | | | " << "| | | | | |";
cout << "\n | | | "
<< "| | |";
cout << "\n | d---e---f | "
<< "| " << c[3] << "---" << c[4] << "---" << c[5] << " |";
cout << "\n | | | | | "
<< "| | | | |";
cout << "\n | | g-h-i | | "
<< "| | " << c[6] << "-" << c[7] << "-" << c[8] << " | |";
cout << "\n | | | | | | | "
<< "| | | | | |";
cout << "\n j-k-l m-n-o " << c[9] << "-" << c[10] << "-" << c[11] << " " << c[12] << "-" << c[13] << "-" << c[14];
cout << "\n | | | | | | | " << "| | | | | |";
cout << "\n | | p-q-r | | " << "| | " << c[15] << "-" << c[16] << "-" << c[17] << " | |";
cout << "\n | | | | | " << "| | | | |";
cout << "\n | s---t---u | " << "| " << c[18] << "---" << c[19] << "---" << c[20] << " |";
cout << "\n | | | " << "| | |";
cout << "\n | | | | | | | "
<< "| | | | | |";
cout << "\n | | p-q-r | | "
<< "| | " << c[15] << "-" << c[16] << "-" << c[17] << " | |";
cout << "\n | | | | | "
<< "| | | | |";
cout << "\n | s---t---u | "
<< "| " << c[18] << "---" << c[19] << "---" << c[20] << " |";
cout << "\n | | | "
<< "| | |";
cout << "\n v-----w-----x " << c[21] << "-----" << c[22] << "-----" << c[23];
cout << "\n";
}
@ -49,13 +60,20 @@ void fieldStruct::printBoard()
//-----------------------------------------------------------------------------
char fieldStruct::GetCharFromStone(int stone)
{
switch (stone) {
case fieldStruct::playerOne: return 'o';
case fieldStruct::playerTwo: return 'x';
case fieldStruct::playerOneWarning: return '1';
case fieldStruct::playerTwoWarning: return '2';
case fieldStruct::playerBothWarning: return '3';
case fieldStruct::squareIsFree: return ' ';
switch (stone)
{
case fieldStruct::playerOne:
return 'o';
case fieldStruct::playerTwo:
return 'x';
case fieldStruct::playerOneWarning:
return '1';
case fieldStruct::playerTwoWarning:
return '2';
case fieldStruct::playerBothWarning:
return '3';
case fieldStruct::squareIsFree:
return ' ';
}
return 'f';
}
@ -75,13 +93,15 @@ void fieldStruct::copyBoard(fieldStruct *destination)
destination->settingPhase = this->settingPhase;
destination->stoneMustBeRemoved = this->stoneMustBeRemoved;
for (i = 0; i < this->size; i++) {
for (i = 0; i < this->size; i++)
{
destination->board[i] = this->board[i];
destination->warnings[i] = this->warnings[i];
destination->stonePartOfMill[i] = this->stonePartOfMill[i];
for (j = 0; j < 4; j++) {
for (j = 0; j < 4; j++)
{
destination->connectedSquare[i][j] = this->connectedSquare[i][j];
destination->stoneMoveAble[i][j] = this->stoneMoveAble[i][j];
@ -104,11 +124,12 @@ void Player::copyPlayer(Player *destination)
destination->warning = this->warning;
destination->numPossibleMoves = this->numPossibleMoves;
for (i = 0; i < MAX_NUM_POS_MOVES; i++) destination->posFrom[i] = this->posFrom[i];
for (i = 0; i < MAX_NUM_POS_MOVES; i++) destination->posTo[i] = this->posTo[i];
for (i = 0; i < MAX_NUM_POS_MOVES; i++)
destination->posFrom[i] = this->posFrom[i];
for (i = 0; i < MAX_NUM_POS_MOVES; i++)
destination->posTo[i] = this->posTo[i];
}
//-----------------------------------------------------------------------------
// Name: createBoard()
// Desc: Creates, but doesn't initialize, the arrays of the of the passed board structure.
@ -136,7 +157,8 @@ void fieldStruct::createBoard()
oppPlayer->numStonesMissing = 0;
// zero
for (i = 0; i < size; i++) {
for (i = 0; i < size; i++)
{
board[i] = squareIsFree;
warnings[i] = noWarning;
stonePartOfMill[i] = 0;

10
src/perfect/millAI.h
View File

@ -16,7 +16,14 @@
/*** Konstanten ******************************************************/
#define MAX_NUM_POS_MOVES (3 * 18) // not (9 * 4) = 36 since the possibilities with 3 stones are more
#define SAFE_DELETE(p) { if(p) { delete (p); (p)=nullptr; } }
#define SAFE_DELETE(p) \
{ \
if (p) \
{ \
delete (p); \
(p) = nullptr; \
} \
}
/*** Klassen *********************************************************/
@ -70,7 +77,6 @@ public:
void deleteBoard();
private:
// helper functions
char GetCharFromStone(int stone);
void setConnection(unsigned int index, int firstDirection, int secondDirection, int thirdDirection, int fourthDirection);

270
src/perfect/minMaxKI.cpp
View File

@ -39,12 +39,19 @@ void MiniMaxAI::play(fieldStruct *theField, unsigned int *pushFrom, unsigned int
unsigned int searchDepth;
// automatic depth
if (depthOfFullTree == 0) {
if (theField->settingPhase) searchDepth = 5;
else if (theField->curPlayer->numStones <= 4) searchDepth = 7;
else if (theField->oppPlayer->numStones <= 4) searchDepth = 7;
else searchDepth = 7;
} else {
if (depthOfFullTree == 0)
{
if (theField->settingPhase)
searchDepth = 5;
else if (theField->curPlayer->numStones <= 4)
searchDepth = 7;
else if (theField->oppPlayer->numStones <= 4)
searchDepth = 7;
else
searchDepth = 7;
}
else
{
searchDepth = depthOfFullTree;
}
@ -60,11 +67,18 @@ void MiniMaxAI::play(fieldStruct *theField, unsigned int *pushFrom, unsigned int
Possibility *rootPossibilities = (Possibility *)getBestChoice(searchDepth, &bestChoice, MAX_NUM_POS_MOVES);
// decode the best choice
if (field->stoneMustBeRemoved) {
*pushFrom = bestChoice; *pushTo = 0;
} else if (field->settingPhase) {
*pushFrom = 0; *pushTo = bestChoice;
} else {
if (field->stoneMustBeRemoved)
{
*pushFrom = bestChoice;
*pushTo = 0;
}
else if (field->settingPhase)
{
*pushFrom = 0;
*pushTo = bestChoice;
}
else
{
*pushFrom = rootPossibilities->from[bestChoice];
*pushTo = rootPossibilities->to[bestChoice];
}
@ -109,10 +123,12 @@ unsigned int *MiniMaxAI::getPossSettingPhase(unsigned int *numPossibilities, voi
unsigned int *idPossibility = &idPossibilities[curSearchDepth * MAX_NUM_POS_MOVES];
// possibilities with cut off
for ((*numPossibilities) = 0, i = 0; i < field->size; i++) {
for ((*numPossibilities) = 0, i = 0; i < field->size; i++)
{
// move possible ?
if (field->board[i] == field->squareIsFree) {
if (field->board[i] == field->squareIsFree)
{
idPossibility[*numPossibilities] = i;
(*numPossibilities)++;
@ -137,16 +153,20 @@ unsigned int *MiniMaxAI::getPossNormalMove(unsigned int *numPossibilities, void
Possibility *possibility = &possibilities[curSearchDepth];
// if he is not allowed to spring
if (field->curPlayer->numStones > 3) {
if (field->curPlayer->numStones > 3)
{
for ((*numPossibilities) = 0, from = 0; from < field->size; from++) {
for (dir = 0; dir < 4; dir++) {
for ((*numPossibilities) = 0, from = 0; from < field->size; from++)
{
for (dir = 0; dir < 4; dir++)
{
// destination
to = field->connectedSquare[from][dir];
// move possible ?
if (to < field->size && field->board[from] == field->curPlayer->id && field->board[to] == field->squareIsFree) {
if (to < field->size && field->board[from] == field->curPlayer->id && field->board[to] == field->squareIsFree)
{
// stone is moveable
idPossibility[*numPossibilities] = *numPossibilities;
@ -158,13 +178,18 @@ unsigned int *MiniMaxAI::getPossNormalMove(unsigned int *numPossibilities, void
}
}
}
} else {
}
else
{
for ((*numPossibilities) = 0, from = 0; from < field->size; from++) {
for (to = 0; to < field->size; to++) {
for ((*numPossibilities) = 0, from = 0; from < field->size; from++)
{
for (to = 0; to < field->size; to++)
{
// move possible ?
if (field->board[from] == field->curPlayer->id && field->board[to] == field->squareIsFree && *numPossibilities < MAX_NUM_POS_MOVES) {
if (field->board[from] == field->curPlayer->id && field->board[to] == field->squareIsFree && *numPossibilities < MAX_NUM_POS_MOVES)
{
// stone is moveable
idPossibility[*numPossibilities] = *numPossibilities;
@ -193,10 +218,12 @@ unsigned int *MiniMaxAI::getPossStoneRemove(unsigned int *numPossibilities, void
unsigned int *idPossibility = &idPossibilities[curSearchDepth * MAX_NUM_POS_MOVES];
// possibilities with cut off
for ((*numPossibilities) = 0, i = 0; i < field->size; i++) {
for ((*numPossibilities) = 0, i = 0; i < field->size; i++)
{
// move possible ?
if (field->board[i] == field->oppPlayer->id && !field->stonePartOfMill[i]) {
if (field->board[i] == field->oppPlayer->id && !field->stonePartOfMill[i])
{
idPossibility[*numPossibilities] = i;
(*numPossibilities)++;
@ -219,14 +246,20 @@ unsigned int *MiniMaxAI::getPossibilities(unsigned int threadNo, unsigned int *n
*opponentsMove = (field->curPlayer->id == ownId) ? false : true;
// When game has ended of course nothing happens any more
if (gameHasFinished) {
if (gameHasFinished)
{
*numPossibilities = 0;
return 0;
// look what is to do
} else {
if (field->stoneMustBeRemoved) return getPossStoneRemove(numPossibilities, pPossibilities);
else if (field->settingPhase) return getPossSettingPhase(numPossibilities, pPossibilities);
else return getPossNormalMove(numPossibilities, pPossibilities);
}
else
{
if (field->stoneMustBeRemoved)
return getPossStoneRemove(numPossibilities, pPossibilities);
else if (field->settingPhase)
return getPossSettingPhase(numPossibilities, pPossibilities);
else
return getPossNormalMove(numPossibilities, pPossibilities);
}
}
@ -277,7 +310,8 @@ void MiniMaxAI::undo(unsigned int threadNo, unsigned int idPossibility, bool opp
field->board[oldState->to] = oldState->fieldTo;
// very expensive
for (int i = 0; i < field->size; i++) {
for (int i = 0; i < field->size; i++)
{
field->stonePartOfMill[i] = oldState->stonePartOfMill[i];
field->warnings[i] = oldState->warnings[i];
}
@ -290,7 +324,8 @@ void MiniMaxAI::undo(unsigned int threadNo, unsigned int idPossibility, bool opp
inline void MiniMaxAI::setWarning(unsigned int stoneOne, unsigned int stoneTwo, unsigned int stoneThree)
{
// if all 3 fields are occupied by current player than he closed a mill
if (field->board[stoneOne] == field->curPlayer->id && field->board[stoneTwo] == field->curPlayer->id && field->board[stoneThree] == field->curPlayer->id) {
if (field->board[stoneOne] == field->curPlayer->id && field->board[stoneTwo] == field->curPlayer->id && field->board[stoneThree] == field->curPlayer->id)
{
field->stonePartOfMill[stoneOne]++;
field->stonePartOfMill[stoneTwo]++;
@ -299,7 +334,8 @@ inline void MiniMaxAI::setWarning(unsigned int stoneOne, unsigned int stoneTwo,
}
// is a mill destroyed ?
if (field->board[stoneOne] == field->squareIsFree && field->stonePartOfMill[stoneOne] && field->stonePartOfMill[stoneTwo] && field->stonePartOfMill[stoneThree]) {
if (field->board[stoneOne] == field->squareIsFree && field->stonePartOfMill[stoneOne] && field->stonePartOfMill[stoneTwo] && field->stonePartOfMill[stoneThree])
{
field->stonePartOfMill[stoneOne]--;
field->stonePartOfMill[stoneTwo]--;
@ -307,40 +343,59 @@ inline void MiniMaxAI::setWarning(unsigned int stoneOne, unsigned int stoneTwo,
}
// stone was set
if (field->board[stoneOne] == field->curPlayer->id) {
if (field->board[stoneOne] == field->curPlayer->id)
{
// a warnig was destroyed
field->warnings[stoneOne] = field->noWarning;
// a warning is created
if (field->board[stoneTwo] == field->curPlayer->id && field->board[stoneThree] == field->squareIsFree) field->warnings[stoneThree] |= field->curPlayer->warning;
if (field->board[stoneThree] == field->curPlayer->id && field->board[stoneTwo] == field->squareIsFree) field->warnings[stoneTwo] |= field->curPlayer->warning;
if (field->board[stoneTwo] == field->curPlayer->id && field->board[stoneThree] == field->squareIsFree)
field->warnings[stoneThree] |= field->curPlayer->warning;
if (field->board[stoneThree] == field->curPlayer->id && field->board[stoneTwo] == field->squareIsFree)
field->warnings[stoneTwo] |= field->curPlayer->warning;
// stone was removed
} else if (field->board[stoneOne] == field->squareIsFree) {
}
else if (field->board[stoneOne] == field->squareIsFree)
{
// a warning is created
if (field->board[stoneTwo] == field->curPlayer->id && field->board[stoneThree] == field->curPlayer->id) field->warnings[stoneOne] |= field->curPlayer->warning;
if (field->board[stoneTwo] == field->oppPlayer->id && field->board[stoneThree] == field->oppPlayer->id) field->warnings[stoneOne] |= field->oppPlayer->warning;
if (field->board[stoneTwo] == field->curPlayer->id && field->board[stoneThree] == field->curPlayer->id)
field->warnings[stoneOne] |= field->curPlayer->warning;
if (field->board[stoneTwo] == field->oppPlayer->id && field->board[stoneThree] == field->oppPlayer->id)
field->warnings[stoneOne] |= field->oppPlayer->warning;
// a warning is destroyed
if (field->warnings[stoneTwo] && field->board[stoneThree] != field->squareIsFree) {
if (field->warnings[stoneTwo] && field->board[stoneThree] != field->squareIsFree)
{
// reset warning if necessary
if (field->board[field->neighbour[stoneTwo][0][0]] == field->curPlayer->id && field->board[field->neighbour[stoneTwo][0][1]] == field->curPlayer->id) field->warnings[stoneTwo] = field->curPlayer->warning;
else if (field->board[field->neighbour[stoneTwo][1][0]] == field->curPlayer->id && field->board[field->neighbour[stoneTwo][1][1]] == field->curPlayer->id) field->warnings[stoneTwo] = field->curPlayer->warning;
else if (field->board[field->neighbour[stoneTwo][0][0]] == field->oppPlayer->id && field->board[field->neighbour[stoneTwo][0][1]] == field->oppPlayer->id) field->warnings[stoneTwo] = field->oppPlayer->warning;
else if (field->board[field->neighbour[stoneTwo][1][0]] == field->oppPlayer->id && field->board[field->neighbour[stoneTwo][1][1]] == field->oppPlayer->id) field->warnings[stoneTwo] = field->oppPlayer->warning;
else field->warnings[stoneTwo] = field->noWarning;
} else if (field->warnings[stoneThree] && field->board[stoneTwo] != field->squareIsFree) {
if (field->board[field->neighbour[stoneTwo][0][0]] == field->curPlayer->id && field->board[field->neighbour[stoneTwo][0][1]] == field->curPlayer->id)
field->warnings[stoneTwo] = field->curPlayer->warning;
else if (field->board[field->neighbour[stoneTwo][1][0]] == field->curPlayer->id && field->board[field->neighbour[stoneTwo][1][1]] == field->curPlayer->id)
field->warnings[stoneTwo] = field->curPlayer->warning;
else if (field->board[field->neighbour[stoneTwo][0][0]] == field->oppPlayer->id && field->board[field->neighbour[stoneTwo][0][1]] == field->oppPlayer->id)
field->warnings[stoneTwo] = field->oppPlayer->warning;
else if (field->board[field->neighbour[stoneTwo][1][0]] == field->oppPlayer->id && field->board[field->neighbour[stoneTwo][1][1]] == field->oppPlayer->id)
field->warnings[stoneTwo] = field->oppPlayer->warning;
else
field->warnings[stoneTwo] = field->noWarning;
}
else if (field->warnings[stoneThree] && field->board[stoneTwo] != field->squareIsFree)
{
// reset warning if necessary
if (field->board[field->neighbour[stoneThree][0][0]] == field->curPlayer->id && field->board[field->neighbour[stoneThree][0][1]] == field->curPlayer->id) field->warnings[stoneThree] = field->curPlayer->warning;
else if (field->board[field->neighbour[stoneThree][1][0]] == field->curPlayer->id && field->board[field->neighbour[stoneThree][1][1]] == field->curPlayer->id) field->warnings[stoneThree] = field->curPlayer->warning;
else if (field->board[field->neighbour[stoneThree][0][0]] == field->oppPlayer->id && field->board[field->neighbour[stoneThree][0][1]] == field->oppPlayer->id) field->warnings[stoneThree] = field->oppPlayer->warning;
else if (field->board[field->neighbour[stoneThree][1][0]] == field->oppPlayer->id && field->board[field->neighbour[stoneThree][1][1]] == field->oppPlayer->id) field->warnings[stoneThree] = field->oppPlayer->warning;
else field->warnings[stoneThree] = field->noWarning;
if (field->board[field->neighbour[stoneThree][0][0]] == field->curPlayer->id && field->board[field->neighbour[stoneThree][0][1]] == field->curPlayer->id)
field->warnings[stoneThree] = field->curPlayer->warning;
else if (field->board[field->neighbour[stoneThree][1][0]] == field->curPlayer->id && field->board[field->neighbour[stoneThree][1][1]] == field->curPlayer->id)
field->warnings[stoneThree] = field->curPlayer->warning;
else if (field->board[field->neighbour[stoneThree][0][0]] == field->oppPlayer->id && field->board[field->neighbour[stoneThree][0][1]] == field->oppPlayer->id)
field->warnings[stoneThree] = field->oppPlayer->warning;
else if (field->board[field->neighbour[stoneThree][1][0]] == field->oppPlayer->id && field->board[field->neighbour[stoneThree][1][1]] == field->oppPlayer->id)
field->warnings[stoneThree] = field->oppPlayer->warning;
else
field->warnings[stoneThree] = field->noWarning;
}
}
}
@ -352,19 +407,28 @@ inline void MiniMaxAI::setWarning(unsigned int stoneOne, unsigned int stoneTwo,
inline void MiniMaxAI::updateWarning(unsigned int firstStone, unsigned int secondStone)
{
// set warnings
if (firstStone < field->size) setWarning(firstStone, field->neighbour[firstStone][0][0], field->neighbour[firstStone][0][1]);
if (firstStone < field->size) setWarning(firstStone, field->neighbour[firstStone][1][0], field->neighbour[firstStone][1][1]);
if (firstStone < field->size)
setWarning(firstStone, field->neighbour[firstStone][0][0], field->neighbour[firstStone][0][1]);
if (firstStone < field->size)
setWarning(firstStone, field->neighbour[firstStone][1][0], field->neighbour[firstStone][1][1]);
if (secondStone < field->size) setWarning(secondStone, field->neighbour[secondStone][0][0], field->neighbour[secondStone][0][1]);
if (secondStone < field->size) setWarning(secondStone, field->neighbour[secondStone][1][0], field->neighbour[secondStone][1][1]);
if (secondStone < field->size)
setWarning(secondStone, field->neighbour[secondStone][0][0], field->neighbour[secondStone][0][1]);
if (secondStone < field->size)
setWarning(secondStone, field->neighbour[secondStone][1][0], field->neighbour[secondStone][1][1]);
// no stone must be removed if each belongs to a mill
unsigned int i;
bool atLeastOneStoneRemoveAble = false;
if (field->stoneMustBeRemoved) for (i = 0; i < field->size; i++) if (field->stonePartOfMill[i] == 0 && field->board[i] == field->oppPlayer->id) {
atLeastOneStoneRemoveAble = true; break;
if (field->stoneMustBeRemoved)
for (i = 0; i < field->size; i++)
if (field->stonePartOfMill[i] == 0 && field->board[i] == field->oppPlayer->id)
{
atLeastOneStoneRemoveAble = true;
break;
}
if (!atLeastOneStoneRemoveAble) field->stoneMustBeRemoved = 0;
if (!atLeastOneStoneRemoveAble)
field->stoneMustBeRemoved = 0;
}
//-----------------------------------------------------------------------------
@ -377,39 +441,54 @@ inline void MiniMaxAI::updatePossibleMoves(unsigned int stone, Player *stoneOwne
unsigned int neighbor, direction;
// look into every direction
for (direction = 0; direction < 4; direction++) {
for (direction = 0; direction < 4; direction++)
{
neighbor = field->connectedSquare[stone][direction];
// neighbor must exist
if (neighbor < field->size) {
if (neighbor < field->size)
{
// relevant when moving from one square to another connected square
if (ignoreStone == neighbor) continue;
if (ignoreStone == neighbor)
continue;
// if there is no neighbour stone than it only affects the actual stone
if (field->board[neighbor] == field->squareIsFree) {
if (field->board[neighbor] == field->squareIsFree)
{
if (stoneRemoved) stoneOwner->numPossibleMoves--;
else stoneOwner->numPossibleMoves++;
if (stoneRemoved)
stoneOwner->numPossibleMoves--;
else
stoneOwner->numPossibleMoves++;
// if there is a neighbour stone than it effects only this one
} else if (field->board[neighbor] == field->curPlayer->id) {
}
else if (field->board[neighbor] == field->curPlayer->id)
{
if (stoneRemoved) field->curPlayer->numPossibleMoves++;
else field->curPlayer->numPossibleMoves--;
if (stoneRemoved)
field->curPlayer->numPossibleMoves++;
else
field->curPlayer->numPossibleMoves--;
}
else
{
} else {
if (stoneRemoved) field->oppPlayer->numPossibleMoves++;
else field->oppPlayer->numPossibleMoves--;
if (stoneRemoved)
field->oppPlayer->numPossibleMoves++;
else
field->oppPlayer->numPossibleMoves--;
}
}
}
// only 3 stones resting
if (field->curPlayer->numStones <= 3 && !field->settingPhase) field->curPlayer->numPossibleMoves = field->curPlayer->numStones * (field->size - field->curPlayer->numStones - field->oppPlayer->numStones);
if (field->oppPlayer->numStones <= 3 && !field->settingPhase) field->oppPlayer->numPossibleMoves = field->oppPlayer->numStones * (field->size - field->curPlayer->numStones - field->oppPlayer->numStones);
if (field->curPlayer->numStones <= 3 && !field->settingPhase)
field->curPlayer->numPossibleMoves = field->curPlayer->numStones * (field->size - field->curPlayer->numStones - field->oppPlayer->numStones);
if (field->oppPlayer->numStones <= 3 && !field->settingPhase)
field->oppPlayer->numPossibleMoves = field->oppPlayer->numStones * (field->size - field->curPlayer->numStones - field->oppPlayer->numStones);
}
//-----------------------------------------------------------------------------
@ -430,7 +509,8 @@ inline void MiniMaxAI::setStone(unsigned int to, Backup *backup)
field->stonesSet++;
// setting phase finished ?
if (field->stonesSet == 18) field->settingPhase = false;
if (field->stonesSet == 18)
field->settingPhase = false;
// update possible moves
updatePossibleMoves(to, field->curPlayer, false, field->size);
@ -488,7 +568,8 @@ inline void MiniMaxAI::removeStone(unsigned int from, Backup *backup)
updateWarning(from, field->size);
// end of game ?
if ((field->oppPlayer->numStones < 3) && (!field->settingPhase)) gameHasFinished = true;
if ((field->oppPlayer->numStones < 3) && (!field->settingPhase))
gameHasFinished = true;
}
//-----------------------------------------------------------------------------
@ -521,33 +602,45 @@ void MiniMaxAI::move(unsigned int threadNo, unsigned int idPossibility, bool opp
curSearchDepth++;
// very expensive
for (i = 0; i < field->size; i++) {
for (i = 0; i < field->size; i++)
{
oldState->stonePartOfMill[i] = field->stonePartOfMill[i];
oldState->warnings[i] = field->warnings[i];
}
// move
if (field->stoneMustBeRemoved) {
if (field->stoneMustBeRemoved)
{
removeStone(idPossibility, oldState);
} else if (field->settingPhase) {
}
else if (field->settingPhase)
{
setStone(idPossibility, oldState);
} else {
}
else
{
normalMove(tmpPossibility->from[idPossibility], tmpPossibility->to[idPossibility], oldState);
}
// when opponent is unable to move than current player has won
if ((!field->oppPlayer->numPossibleMoves) && (!field->settingPhase) && (!field->stoneMustBeRemoved) && (field->oppPlayer->numStones > 3)) gameHasFinished = true;
if ((!field->oppPlayer->numPossibleMoves) && (!field->settingPhase) && (!field->stoneMustBeRemoved) && (field->oppPlayer->numStones > 3))
gameHasFinished = true;
// calc value
if (!opponentsMove) currentValue = (float)field->oppPlayer->numStonesMissing - field->curPlayer->numStonesMissing + field->stoneMustBeRemoved + field->curPlayer->numPossibleMoves * 0.1f - field->oppPlayer->numPossibleMoves * 0.1f;
else currentValue = (float)field->curPlayer->numStonesMissing - field->oppPlayer->numStonesMissing - field->stoneMustBeRemoved + field->oppPlayer->numPossibleMoves * 0.1f - field->curPlayer->numPossibleMoves * 0.1f;
if (!opponentsMove)
currentValue = (float)field->oppPlayer->numStonesMissing - field->curPlayer->numStonesMissing + field->stoneMustBeRemoved + field->curPlayer->numPossibleMoves * 0.1f - field->oppPlayer->numPossibleMoves * 0.1f;
else
currentValue = (float)field->curPlayer->numStonesMissing - field->oppPlayer->numStonesMissing - field->stoneMustBeRemoved + field->oppPlayer->numPossibleMoves * 0.1f - field->curPlayer->numPossibleMoves * 0.1f;
// when game has finished - perfect for the current player
if (gameHasFinished && !opponentsMove) currentValue = VALUE_GAME_WON - curSearchDepth;
if (gameHasFinished && opponentsMove) currentValue = VALUE_GAME_LOST + curSearchDepth;
if (gameHasFinished && !opponentsMove)
currentValue = VALUE_GAME_WON - curSearchDepth;
if (gameHasFinished && opponentsMove)
currentValue = VALUE_GAME_LOST + curSearchDepth;
// set next player
if (!field->stoneMustBeRemoved) {
if (!field->stoneMustBeRemoved)
{
tmpPlayer = field->curPlayer;
field->curPlayer = field->oppPlayer;
field->oppPlayer = tmpPlayer;
@ -564,7 +657,10 @@ void MiniMaxAI::printMoveInformation(unsigned int threadNo, unsigned int idPossi
Possibility *tmpPossibility = (Possibility *)pPossibilities;
// move
if (field->stoneMustBeRemoved) cout << "remove stone from " << (char)(idPossibility + 97);
else if (field->settingPhase) cout << "set stone to " << (char)(idPossibility + 97);
else cout << "move from " << (char)(tmpPossibility->from[idPossibility] + 97) << " to " << (char)(tmpPossibility->to[idPossibility] + 97);
if (field->stoneMustBeRemoved)
cout << "remove stone from " << (char)(idPossibility + 97);
else if (field->settingPhase)
cout << "set stone to " << (char)(idPossibility + 97);
else
cout << "move from " << (char)(tmpPossibility->from[idPossibility] + 97) << " to " << (char)(tmpPossibility->to[idPossibility] + 97);
}

69
src/perfect/miniMax.cpp
View File

@ -44,12 +44,15 @@ MiniMax::MiniMax()
numWriteSkvOperations = 0;
numReadPlyOperations = 0;
numWritePlyOperations = 0;
if (MEASURE_ONLY_IO) {
if (MEASURE_ONLY_IO)
{
readSkvInterval.QuadPart = 0;
writeSkvInterval.QuadPart = 0;
readPlyInterval.QuadPart = 0;
writePlyInterval.QuadPart = 0;
} else {
}
else
{
QueryPerformanceCounter(&readSkvInterval);
QueryPerformanceCounter(&writeSkvInterval);
QueryPerformanceCounter(&readPlyInterval);
@ -88,7 +91,8 @@ MiniMax::~MiniMax()
//-----------------------------------------------------------------------------
bool MiniMax::falseOrStop()
{
if (stopOnCriticalError) WaitForSingleObject(GetCurrentProcess(), INFINITE);
if (stopOnCriticalError)
WaitForSingleObject(GetCurrentProcess(), INFINITE);
return false;
}
@ -143,7 +147,8 @@ void MiniMax::calculateDatabase(unsigned int maxDepthOfTree, bool onlyPrepareLay
prepareDatabaseCalculation();
// when database not completed then do it
if (hFileShortKnotValues != nullptr && skvfHeader.completed == false) {
if (hFileShortKnotValues != nullptr && skvfHeader.completed == false)
{
// reserve memory
lastCalculatedLayer.clear();
@ -154,13 +159,16 @@ void MiniMax::calculateDatabase(unsigned int maxDepthOfTree, bool onlyPrepareLay
arrayInfos.vectorArrays.resize(ArrayInfo::numArrayTypes * skvfHeader.numLayers, arrayInfos.listArrays.end());
// calc layer after layer, beginning with the last one
for (curCalculatedLayer = 0; curCalculatedLayer < skvfHeader.numLayers; curCalculatedLayer++) {
for (curCalculatedLayer = 0; curCalculatedLayer < skvfHeader.numLayers; curCalculatedLayer++)
{
// layer already calculated?
if (layerStats[curCalculatedLayer].layerIsCompletedAndInFile) continue;
if (layerStats[curCalculatedLayer].layerIsCompletedAndInFile)
continue;
// don't calc if neither the layer nor the partner layer has any knots
if (layerStats[curCalculatedLayer].knotsInLayer == 0 && layerStats[layerStats[curCalculatedLayer].partnerLayer].knotsInLayer == 0) continue;
if (layerStats[curCalculatedLayer].knotsInLayer == 0 && layerStats[layerStats[curCalculatedLayer].partnerLayer].knotsInLayer == 0)
continue;
// calc
abortCalculation = (!calcLayer(curCalculatedLayer));
@ -170,8 +178,10 @@ void MiniMax::calculateDatabase(unsigned int maxDepthOfTree, bool onlyPrepareLay
unloadAllPlyInfos();
// don't save layer and header when only preparing layers
if (onlyPrepareLayer) return;
if (abortCalculation) break;
if (onlyPrepareLayer)
return;
if (abortCalculation)
break;
// save header
saveHeader(&skvfHeader, layerStats);
@ -179,8 +189,10 @@ void MiniMax::calculateDatabase(unsigned int maxDepthOfTree, bool onlyPrepareLay
}
// don't save layer and header when only preparing layers or when
if (onlyPrepareLayer) return;
if (!abortCalculation) {
if (onlyPrepareLayer)
return;
if (!abortCalculation)
{
// calc layer statistics
calcLayerStatistics("statistics.txt");
@ -194,7 +206,9 @@ void MiniMax::calculateDatabase(unsigned int maxDepthOfTree, bool onlyPrepareLay
// free mem
curCalculationActionId = MM_ACTION_NONE;
} else {
}
else
{
PRINT(1, this, "\nThe database is already fully calculated.\n");
}
@ -216,35 +230,45 @@ bool MiniMax::calcLayer(unsigned int layerNumber)
vector<unsigned int> layersToCalculate;
// moves can be done reverse, leading to too depth searching trees
if (shallRetroAnalysisBeUsed(layerNumber)) {
if (shallRetroAnalysisBeUsed(layerNumber))
{
// calc values for all states of layer
layersToCalculate.push_back(layerNumber);
if (layerNumber != layerStats[layerNumber].partnerLayer) layersToCalculate.push_back(layerStats[layerNumber].partnerLayer);
if (!calcKnotValuesByRetroAnalysis(layersToCalculate)) return false;
if (layerNumber != layerStats[layerNumber].partnerLayer)
layersToCalculate.push_back(layerStats[layerNumber].partnerLayer);
if (!calcKnotValuesByRetroAnalysis(layersToCalculate))
return false;
// save partner layer
if (layerStats[layerNumber].partnerLayer != layerNumber) {
if (layerStats[layerNumber].partnerLayer != layerNumber)
{
saveLayerToFile(layerStats[layerNumber].partnerLayer);
}
// use minimax-algorithm
} else {
if (!calcKnotValuesByAlphaBeta(layerNumber)) return false;
}
else
{
if (!calcKnotValuesByAlphaBeta(layerNumber))
return false;
}
// save layer
saveLayerToFile(layerNumber);
// test layer
if (!testLayer(layerNumber)) {
if (!testLayer(layerNumber))
{
PRINT(0, this, "ERROR: Layer calculation cancelled or failed!" << endl);
return false;
}
// test partner layer if retro-analysis has been used
if (shallRetroAnalysisBeUsed(layerNumber) && layerStats[layerNumber].partnerLayer != layerNumber) {
if (!testLayer(layerStats[layerNumber].partnerLayer)) {
if (shallRetroAnalysisBeUsed(layerNumber) && layerStats[layerNumber].partnerLayer != layerNumber)
{
if (!testLayer(layerStats[layerNumber].partnerLayer))
{
PRINT(0, this, "ERROR: Layer calculation cancelled or failed!" << endl);
return false;
}
@ -252,7 +276,8 @@ bool MiniMax::calcLayer(unsigned int layerNumber)
// update output information
EnterCriticalSection(&csOsPrint);
if (shallRetroAnalysisBeUsed(layerNumber) && layerNumber != layerStats[layerNumber].partnerLayer) {
if (shallRetroAnalysisBeUsed(layerNumber) && layerNumber != layerStats[layerNumber].partnerLayer)
{
lastCalculatedLayer.push_back(layerStats[layerNumber].partnerLayer);
}
lastCalculatedLayer.push_back(layerNumber);

159
src/perfect/miniMax.h
View File

@ -85,16 +85,33 @@ database: The database contains the arrays with the short knot values and the
#define MM_ACTION_NONE 8
/*** Macros ***************************************************************************************************************************/
#define SAFE_DELETE(p) { if(p) { delete (p); (p)=nullptr; } }
#define SAFE_DELETE_ARRAY(p) { if(p) { delete[] (p); (p)=nullptr; } }
#define SAFE_DELETE(p) \
{ \
if (p) \
{ \
delete (p); \
(p) = nullptr; \
} \
}
#define SAFE_DELETE_ARRAY(p) \
{ \
if (p) \
{ \
delete[](p); \
(p) = nullptr; \
} \
}
// here a macro is used instead of a function because the text 't' is passed like "blabla" << endl << aVariable
#define PRINT(v, c, t) \
{ \
if (c->verbosity > v) { \
if (c->verbosity > v) \
{ \
EnterCriticalSection(&c->csOsPrint); \
*c->osPrint << endl << t; \
if (c->userPrintFunc != nullptr) { \
*c->osPrint << endl \
<< t; \
if (c->userPrintFunc != nullptr) \
{ \
c->userPrintFunc(c->pDataForUserPrintFunc); \
} \
LeaveCriticalSection(&c->csOsPrint); \
@ -108,7 +125,6 @@ class MiniMax
friend class MiniMaxWinCalcDb;
public:
/*** typedefines ***************************************************************************************************************************/
typedef unsigned char TwoBit; // 2-Bit variable ranging from 0 to 3
typedef unsigned short PlyInfoVarType; // 2 Bytes for saving the ply info
@ -226,7 +242,6 @@ public:
void updateArray(unsigned int layerNumber, unsigned int type);
};
/*** public functions ***************************************************************************************************************************/
// Constructor / destructor
@ -274,26 +289,30 @@ public:
// Virtual Functions
virtual void prepareBestChoiceCalculation()
{
while (true);
while (true)
;
}; // is called once before building the tree
virtual unsigned int *getPossibilities(unsigned int threadNo, unsigned int *numPossibilities, bool *opponentsMove, void **pPossibilities)
{
while (true); return 0;
while (true)
;
return 0;
}; // returns a pointer to the possibility-IDs
virtual void deletePossibilities(unsigned int threadNo, void *pPossibilities)
{
while (true);
};
virtual void storeValueOfMove(unsigned int threadNo, unsigned int idPossibility, void *pPossibilities, TwoBit value, unsigned int *freqValuesSubMoves, PlyInfoVarType plyInfo)
{
while (true)
;
};
virtual void storeValueOfMove(unsigned int threadNo, unsigned int idPossibility, void *pPossibilities, TwoBit value, unsigned int *freqValuesSubMoves, PlyInfoVarType plyInfo){};
virtual void move(unsigned int threadNo, unsigned int idPossibility, bool opponentsMove, void **pBackup, void *pPossibilities)
{
while (true);
while (true)
;
};
virtual void undo(unsigned int threadNo, unsigned int idPossibility, bool opponentsMove, void *pBackup, void *pPossibilities)
{
while (true);
while (true)
;
};
virtual bool shallRetroAnalysisBeUsed(unsigned int layerNum)
@ -302,79 +321,103 @@ public:
};
virtual unsigned int getNumberOfLayers()
{
while (true); return 0;
while (true)
;
return 0;
};
virtual unsigned int getNumberOfKnotsInLayer(unsigned int layerNum)
{
while (true); return 0;
while (true)
;
return 0;
};
virtual void getSuccLayers(unsigned int layerNum, unsigned int *amountOfSuccLayers, unsigned int *succLayers)
{
while (true);
while (true)
;
};
virtual unsigned int getPartnerLayer(unsigned int layerNum)
{
while (true); return 0;
while (true)
;
return 0;
};
virtual string getOutputInformation(unsigned int layerNum)
{
while (true); return string("");
while (true)
;
return string("");
};
virtual void setOpponentLevel(unsigned int threadNo, bool isOpponentLevel)
{
while (true);
while (true)
;
};
virtual bool setSituation(unsigned int threadNo, unsigned int layerNum, unsigned int stateNumber)
{
while (true); return false;
while (true)
;
return false;
};
virtual void getValueOfSituation(unsigned int threadNo, float &floatValue, TwoBit &shortValue)
{
while (true);
while (true)
;
}; // value of situation for the initial current player
virtual bool getOpponentLevel(unsigned int threadNo)
{
while (true); return false;
while (true)
;
return false;
};
virtual unsigned int getLayerAndStateNumber(unsigned int threadNo, unsigned int &layerNum, unsigned int &stateNumber)
{
while (true); return 0;
while (true)
;
return 0;
};
virtual unsigned int getLayerNumber(unsigned int threadNo)
{
while (true); return 0;
while (true)
;
return 0;
};
virtual void getSymStateNumWithDoubles(unsigned int threadNo, unsigned int *numSymmetricStates, unsigned int **symStateNumbers)
{
while (true);
while (true)
;
};
virtual void getPredecessors(unsigned int threadNo, unsigned int *amountOfPred, RetroAnalysisPredVars *predVars)
{
while (true);
while (true)
;
};
virtual void printBoard(unsigned int threadNo, unsigned char value)
{
while (true);
while (true)
;
};
virtual void printMoveInformation(unsigned int threadNo, unsigned int idPossibility, void *pPossibilities)
{
while (true);
while (true)
;
};
virtual void prepareDatabaseCalculation()
{
while (true);
while (true)
;
};
virtual void wrapUpDatabaseCalculation(bool calculationAborted)
{
while (true);
while (true)
;
};
private:
/*** classes for testing ********************************************************************************************************************/
struct TestLayersVars
@ -408,13 +451,15 @@ private:
AlphaBetaGlobalVars(MiniMax *pMiniMax, unsigned int layerNumber)
{
this->thread.resize(pMiniMax->threadManager.getNumThreads());
for (unsigned int threadNo = 0; threadNo < pMiniMax->threadManager.getNumThreads(); threadNo++) {
for (unsigned int threadNo = 0; threadNo < pMiniMax->threadManager.getNumThreads(); threadNo++)
{
this->thread[threadNo].numStatesToProcess = 0;
this->thread[threadNo].threadNo = threadNo;
}
this->layerNumber = layerNumber;
this->pMiniMax = pMiniMax;
if (pMiniMax->layerStats) {
if (pMiniMax->layerStats)
{
this->numKnotsToCalc = pMiniMax->layerStats[layerNumber].knotsInLayer;
this->totalNumKnots = pMiniMax->layerStats[layerNumber].knotsInLayer;
}
@ -433,23 +478,23 @@ private:
LONGLONG statesProcessed;
unsigned int statsValueCounter[SKV_NUM_VALUES];
AlphaBetaDefaultThreadVars()
{
};
AlphaBetaDefaultThreadVars(){};
AlphaBetaDefaultThreadVars(MiniMax *pMiniMax, AlphaBetaGlobalVars *alphaBetaVars, unsigned int layerNumber)
{
this->statesProcessed = 0;
this->layerNumber = layerNumber;
this->pMiniMax = pMiniMax;
this->alphaBetaVars = alphaBetaVars;
for (unsigned int curStateValue = 0; curStateValue < SKV_NUM_VALUES; curStateValue++) {
for (unsigned int curStateValue = 0; curStateValue < SKV_NUM_VALUES; curStateValue++)
{
this->statsValueCounter[curStateValue] = 0;
}
};
void reduceDefault()
{
pMiniMax->numStatesProcessed += this->statesProcessed;
for (unsigned int curStateValue = 0; curStateValue < SKV_NUM_VALUES; curStateValue++) {
for (unsigned int curStateValue = 0; curStateValue < SKV_NUM_VALUES; curStateValue++)
{
alphaBetaVars->statsValueCounter[curStateValue] += this->statsValueCounter[curStateValue];
}
};
@ -460,9 +505,7 @@ private:
BufferedFile *bufferedFile;
bool initAlreadyDone;
InitAlphaBetaVars()
{
};
InitAlphaBetaVars(){};
InitAlphaBetaVars(MiniMax *pMiniMax, AlphaBetaGlobalVars *alphaBetaVars, unsigned int layerNumber, BufferedFile *initArray, bool initAlreadyDone) : AlphaBetaDefaultThreadVars(pMiniMax, alphaBetaVars, layerNumber)
{
this->bufferedFile = initArray;
@ -484,16 +527,15 @@ private:
unsigned int *freqValuesSubMovesBranchWon = nullptr; // ...
unsigned int freqValuesSubMoves[4]; // ...
RunAlphaBetaVars()
{
};
RunAlphaBetaVars(){};
RunAlphaBetaVars(MiniMax *pMiniMax, AlphaBetaGlobalVars *alphaBetaVars, unsigned int layerNumber) : AlphaBetaDefaultThreadVars(pMiniMax, alphaBetaVars, layerNumber)
{
initializeElement(*this);
};
~RunAlphaBetaVars()
{
SAFE_DELETE_ARRAY(branchArray); SAFE_DELETE_ARRAY(freqValuesSubMovesBranchWon);
SAFE_DELETE_ARRAY(branchArray);
SAFE_DELETE_ARRAY(freqValuesSubMovesBranchWon);
}
void reduce()
{
@ -543,23 +585,23 @@ private:
LONGLONG statesProcessed;
unsigned int statsValueCounter[SKV_NUM_VALUES];
RetroAnalysisDefaultThreadVars()
{
};
RetroAnalysisDefaultThreadVars(){};
RetroAnalysisDefaultThreadVars(MiniMax *pMiniMax, retroAnalysisGlobalVars *retroVars, unsigned int layerNumber)
{
this->statesProcessed = 0;
this->layerNumber = layerNumber;
this->pMiniMax = pMiniMax;
this->retroVars = retroVars;
for (unsigned int curStateValue = 0; curStateValue < SKV_NUM_VALUES; curStateValue++) {
for (unsigned int curStateValue = 0; curStateValue < SKV_NUM_VALUES; curStateValue++)
{
this->statsValueCounter[curStateValue] = 0;
}
};
void reduceDefault()
{
pMiniMax->numStatesProcessed += this->statesProcessed;
for (unsigned int curStateValue = 0; curStateValue < SKV_NUM_VALUES; curStateValue++) {
for (unsigned int curStateValue = 0; curStateValue < SKV_NUM_VALUES; curStateValue++)
{
retroVars->statsValueCounter[curStateValue] += this->statsValueCounter[curStateValue];
}
};
@ -570,9 +612,7 @@ private:
BufferedFile *bufferedFile;
bool initAlreadyDone;
InitRetroAnalysisVars()
{
};
InitRetroAnalysisVars(){};
InitRetroAnalysisVars(MiniMax *pMiniMax, retroAnalysisGlobalVars *retroVars, unsigned int layerNumber, BufferedFile *initArray, bool initAlreadyDone) : RetroAnalysisDefaultThreadVars(pMiniMax, retroVars, layerNumber)
{
this->bufferedFile = initArray;
@ -592,12 +632,8 @@ private:
{
RetroAnalysisPredVars predVars[MAX_NUM_PREDECESSORS];
AddNumSuccedorsVars()
{
};
AddNumSuccedorsVars(MiniMax *pMiniMax, retroAnalysisGlobalVars *retroVars, unsigned int layerNumber) : RetroAnalysisDefaultThreadVars(pMiniMax, retroVars, layerNumber)
{
};
AddNumSuccedorsVars(){};
AddNumSuccedorsVars(MiniMax *pMiniMax, retroAnalysisGlobalVars *retroVars, unsigned int layerNumber) : RetroAnalysisDefaultThreadVars(pMiniMax, retroVars, layerNumber){};
void initializeElement(AddNumSuccedorsVars &master)
{
*this = master;
@ -608,7 +644,6 @@ private:
};
};
/*** private variables ***************************************************************************************************************************/
// variables, which are constant during database calculation

29
src/perfect/miniMaxAI.h
View File

@ -24,7 +24,6 @@
class MiniMaxAI : public MillAI, MiniMax
{
protected:
// structs
struct Possibility
{
@ -91,9 +90,7 @@ protected:
{
return 0;
};
void getSuccLayers(unsigned int layerNum, unsigned int *amountOfSuccLayers, unsigned int *succLayers)
{
};
void getSuccLayers(unsigned int layerNum, unsigned int *amountOfSuccLayers, unsigned int *succLayers){};
unsigned int getPartnerLayer(unsigned int layerNum)
{
return 0;
@ -102,9 +99,7 @@ protected:
{
return string("");
};
void setOpponentLevel(unsigned int threadNo, bool isOpponentLevel)
{
};
void setOpponentLevel(unsigned int threadNo, bool isOpponentLevel){};
bool setSituation(unsigned int threadNo, unsigned int layerNum, unsigned int stateNumber)
{
return false;
@ -121,21 +116,11 @@ protected:
{
return 0;
};
void getSymStateNumWithDoubles(unsigned int threadNo, unsigned int *numSymmetricStates, unsigned int **symStateNumbers)
{
};
void getPredecessors(unsigned int threadNo, unsigned int *amountOfPred, RetroAnalysisPredVars *predVars)
{
};
void printBoard(unsigned int threadNo, unsigned char value)
{
};
void prepareDatabaseCalculation()
{
};
void wrapUpDatabaseCalculation(bool calculationAborted)
{
};
void getSymStateNumWithDoubles(unsigned int threadNo, unsigned int *numSymmetricStates, unsigned int **symStateNumbers){};
void getPredecessors(unsigned int threadNo, unsigned int *amountOfPred, RetroAnalysisPredVars *predVars){};
void printBoard(unsigned int threadNo, unsigned char value){};
void prepareDatabaseCalculation(){};
void wrapUpDatabaseCalculation(bool calculationAborted){};
public:
// Constructor / destructor

18
src/perfect/miniMaxWin.h
View File

@ -19,15 +19,9 @@
class MiniMaxGuiField
{
public:
virtual void setAlignment(wildWeasel::alignment &newAlignment)
{
};
virtual void setVisibility(bool visible)
{
};
virtual void setState(unsigned int curShowedLayer, MiniMax::StateNumberVarType curShowedState)
{
};
virtual void setAlignment(wildWeasel::alignment &newAlignment){};
virtual void setVisibility(bool visible){};
virtual void setState(unsigned int curShowedLayer, MiniMax::StateNumberVarType curShowedState){};
};
/*------------------------------------------------------------------------------------
@ -58,7 +52,6 @@ public:
class MiniMaxWinInspectDb
{
protected:
// General Variables
MiniMax *pMiniMax = nullptr; // pointer to perfect AI class granting the access to the database
MiniMaxGuiField *pGuiField = nullptr;
@ -68,7 +61,6 @@ protected:
const unsigned int scrollBarWidth = 20;
public:
// Constructor / destructor
MiniMaxWinInspectDb(wildWeasel::masterMind *ww, MiniMax *pMiniMax, wildWeasel::alignment &amInspectDb, wildWeasel::font2D *font, wildWeasel::texture *textureLine, MiniMaxGuiField &guiField);
~MiniMaxWinInspectDb();
@ -110,7 +102,6 @@ public:
class MiniMaxWinCalcDb
{
protected:
// Calculation variables
wildWeasel::masterMind *ww = nullptr; // pointer to engine
MiniMax *pMiniMax = nullptr; // pointer to perfect AI class granting the access to the database
@ -132,8 +123,6 @@ protected:
const float labelHeight = 30; //
const float buttonHeight = 30; //
// Calculation Functions
void buttonFuncCalcStartOrContinue(void *pUser);
void buttonFuncCalcCancel(void *pUser);
@ -149,7 +138,6 @@ protected:
void threadProcTestLayer();
public:
// Constructor / destructor
MiniMaxWinCalcDb(wildWeasel::masterMind *ww, MiniMax *pMiniMax, wildWeasel::alignment &amCalculation, wildWeasel::font2D *font, wildWeasel::texture *textureLine);
~MiniMaxWinCalcDb();

283
src/perfect/miniMax_alphaBetaAlgorithmn.cpp
View File

@ -23,13 +23,15 @@ bool MiniMax::calcKnotValuesByAlphaBeta(unsigned int layerNumber)
// initialization
PRINT(2, this, " Bytes in memory: " << memoryUsed2 << endl);
if (!initAlphaBeta(alphaBetaVars)) {
if (!initAlphaBeta(alphaBetaVars))
{
return false;
}
// run alpha-beta algorithmn
PRINT(2, this, " Bytes in memory: " << memoryUsed2 << endl);
if (!runAlphaBeta(alphaBetaVars)) {
if (!runAlphaBeta(alphaBetaVars))
{
return false;
}
@ -53,8 +55,11 @@ void MiniMax::alphaBetaSaveInDatabase(unsigned int threadNo, unsigned int layerN
unsigned int i;
// invert value ?
if (knotValue > SKV_VALUE_GAME_WON) while (true);
if (invertValue) knotValue = skvPerspectiveMatrix[knotValue][PL_TO_MOVE_UNCHANGED];
if (knotValue > SKV_VALUE_GAME_WON)
while (true)
;
if (invertValue)
knotValue = skvPerspectiveMatrix[knotValue][PL_TO_MOVE_UNCHANGED];
// get numbers of symmetric states
getSymStateNumWithDoubles(threadNo, &numSymmetricStates, &symStateNumbers);
@ -64,13 +69,15 @@ void MiniMax::alphaBetaSaveInDatabase(unsigned int threadNo, unsigned int layerN
savePlyInfoInDatabase(layerNumber, stateNumber, plyValue);
// save value for all symmetric states
for (i = 0; i < numSymmetricStates; i++) {
for (i = 0; i < numSymmetricStates; i++)
{
// get state number
sysStateNumber = symStateNumbers[i];
// don't save original state twice
if (sysStateNumber == stateNumber) continue;
if (sysStateNumber == stateNumber)
continue;
// save
saveKnotValueInDatabase(layerNumber, sysStateNumber, knotValue);
@ -94,13 +101,16 @@ bool MiniMax::initAlphaBeta(AlphaBetaGlobalVars &alphaBetaVars)
PRINT(1, this, endl << " *** Signing of invalid states for layer " << alphaBetaVars.layerNumber << " (" << (getOutputInformation(alphaBetaVars.layerNumber)) << ") which has " << layerStats[alphaBetaVars.layerNumber].knotsInLayer << " knots ***");
// file names
ssInvArrayDirectory.str(""); ssInvArrayDirectory << fileDirectory << (fileDirectory.size() ? "\\" : "") << "invalidStates";
ssInvArrayFilePath.str(""); ssInvArrayFilePath << fileDirectory << (fileDirectory.size() ? "\\" : "") << "invalidStates\\invalidStatesOfLayer" << alphaBetaVars.layerNumber << ".dat";
ssInvArrayDirectory.str("");
ssInvArrayDirectory << fileDirectory << (fileDirectory.size() ? "\\" : "") << "invalidStates";
ssInvArrayFilePath.str("");
ssInvArrayFilePath << fileDirectory << (fileDirectory.size() ? "\\" : "") << "invalidStates\\invalidStatesOfLayer" << alphaBetaVars.layerNumber << ".dat";
// does initialization file exist ?
CreateDirectoryA(ssInvArrayDirectory.str().c_str(), nullptr);
invalidArray = new BufferedFile(threadManager.getNumThreads(), FILE_BUFFER_SIZE, ssInvArrayFilePath.str().c_str());
if (invalidArray->getFileSize() == (LONGLONG)layerStats[alphaBetaVars.layerNumber].knotsInLayer) {
if (invalidArray->getFileSize() == (LONGLONG)layerStats[alphaBetaVars.layerNumber].knotsInLayer)
{
PRINT(2, this, " Loading invalid states from file: " << ssInvArrayFilePath.str());
initAlreadyDone = true;
}
@ -114,7 +124,8 @@ bool MiniMax::initAlphaBeta(AlphaBetaGlobalVars &alphaBetaVars)
ThreadManager::ThreadVarsArray<InitAlphaBetaVars> tva(threadManager.getNumThreads(), InitAlphaBetaVars(this, &alphaBetaVars, alphaBetaVars.layerNumber, invalidArray, initAlreadyDone));
// process each state in the current layer
switch (threadManager.executeParallelLoop(initAlphaBetaThreadProc, tva.getPointerToArray(), tva.getSizeOfArray(), TM_SCHEDULE_STATIC, 0, layerStats[alphaBetaVars.layerNumber].knotsInLayer - 1, 1)) {
switch (threadManager.executeParallelLoop(initAlphaBetaThreadProc, tva.getPointerToArray(), tva.getSizeOfArray(), TM_SCHEDULE_STATIC, 0, layerStats[alphaBetaVars.layerNumber].knotsInLayer - 1, 1))
{
case TM_RETURN_VALUE_OK:
break;
case TM_RETURN_VALUE_EXECUTION_CANCELLED:
@ -130,7 +141,8 @@ bool MiniMax::initAlphaBeta(AlphaBetaGlobalVars &alphaBetaVars)
// reduce and delete thread specific data
tva.reduce();
if (numStatesProcessed < layerStats[alphaBetaVars.layerNumber].knotsInLayer) {
if (numStatesProcessed < layerStats[alphaBetaVars.layerNumber].knotsInLayer)
{
SAFE_DELETE(invalidArray);
return falseOrStop();
}
@ -168,34 +180,47 @@ DWORD MiniMax::initAlphaBetaThreadProc(void *pParameter, int index)
iabVars->statesProcessed++;
// print status
if (iabVars->statesProcessed % OUTPUT_EVERY_N_STATES == 0) {
if (iabVars->statesProcessed % OUTPUT_EVERY_N_STATES == 0)
{
m->numStatesProcessed += OUTPUT_EVERY_N_STATES;
PRINT(2, m, "Already initialized " << m->numStatesProcessed << " of " << m->layerStats[curState.layerNumber].knotsInLayer << " states");
}
// layer initialization already done ? if so, then read from file
if (iabVars->initAlreadyDone) {
if (!iabVars->bufferedFile->readBytes(iabVars->curThreadNo, index * sizeof(TwoBit), sizeof(TwoBit), (unsigned char *)&curStateValue)) {
if (iabVars->initAlreadyDone)
{
if (!iabVars->bufferedFile->readBytes(iabVars->curThreadNo, index * sizeof(TwoBit), sizeof(TwoBit), (unsigned char *)&curStateValue))
{
PRINT(0, m, "ERROR: initArray->takeBytes() failed");
return m->falseOrStop();
}
// initialization not done
} else {
}
else
{
// set current selected situation
if (!m->setSituation(iabVars->curThreadNo, curState.layerNumber, curState.stateNumber)) {
if (!m->setSituation(iabVars->curThreadNo, curState.layerNumber, curState.stateNumber))
{
curStateValue = SKV_VALUE_INVALID;
} else {
}
else
{
// get value of current situation
m->getValueOfSituation(iabVars->curThreadNo, floatValue, curStateValue);
}
}
// calc ply info
if (curStateValue == SKV_VALUE_GAME_WON || curStateValue == SKV_VALUE_GAME_LOST) {
if (curStateValue == SKV_VALUE_GAME_WON || curStateValue == SKV_VALUE_GAME_LOST)
{
plyInfo = 0;
} else if (curStateValue == SKV_VALUE_INVALID) {
}
else if (curStateValue == SKV_VALUE_INVALID)
{
plyInfo = PLYINFO_VALUE_INVALID;
} else {
}
else
{
plyInfo = PLYINFO_VALUE_UNCALCULATED;
}
@ -204,8 +229,10 @@ DWORD MiniMax::initAlphaBetaThreadProc(void *pParameter, int index)
m->savePlyInfoInDatabase(curState.layerNumber, curState.stateNumber, plyInfo);
// write data to file
if (!iabVars->initAlreadyDone) {
if (!iabVars->bufferedFile->writeBytes(iabVars->curThreadNo, index * sizeof(TwoBit), sizeof(TwoBit), (unsigned char *)&curStateValue)) {
if (!iabVars->initAlreadyDone)
{
if (!iabVars->bufferedFile->writeBytes(iabVars->curThreadNo, index * sizeof(TwoBit), sizeof(TwoBit), (unsigned char *)&curStateValue))
{
PRINT(0, m, "ERROR: bufferedFile->writeBytes failed!");
return m->falseOrStop();
}
@ -234,7 +261,8 @@ bool MiniMax::runAlphaBeta(AlphaBetaGlobalVars &alphaBetaVars)
threadManager.setNumThreads(1);
// process each state in the current layer
switch (threadManager.executeParallelLoop(runAlphaBetaThreadProc, tva.getPointerToArray(), tva.getSizeOfArray(), TM_SCHEDULE_STATIC, 0, layerStats[alphaBetaVars.layerNumber].knotsInLayer - 1, 1)) {
switch (threadManager.executeParallelLoop(runAlphaBetaThreadProc, tva.getPointerToArray(), tva.getSizeOfArray(), TM_SCHEDULE_STATIC, 0, layerStats[alphaBetaVars.layerNumber].knotsInLayer - 1, 1))
{
case TM_RETURN_VALUE_OK:
break;
case TM_RETURN_VALUE_EXECUTION_CANCELLED:
@ -249,7 +277,8 @@ bool MiniMax::runAlphaBeta(AlphaBetaGlobalVars &alphaBetaVars)
// reduce and delete thread specific data
tva.reduce();
if (numStatesProcessed < layerStats[alphaBetaVars.layerNumber].knotsInLayer) return falseOrStop();
if (numStatesProcessed < layerStats[alphaBetaVars.layerNumber].knotsInLayer)
return falseOrStop();
// show statistics
PRINT(2, this, " won states: " << alphaBetaVars.statsValueCounter[SKV_VALUE_GAME_WON]);
@ -278,22 +307,26 @@ DWORD MiniMax::runAlphaBetaThreadProc(void *pParameter, int index)
rabVars->statesProcessed++;
// print status
if (rabVars->statesProcessed % OUTPUT_EVERY_N_STATES == 0) {
if (rabVars->statesProcessed % OUTPUT_EVERY_N_STATES == 0)
{
m->numStatesProcessed += OUTPUT_EVERY_N_STATES;
PRINT(2, m, " Processed " << m->numStatesProcessed << " of " << m->layerStats[curState.layerNumber].knotsInLayer << " states");
}
// Version 10: state already calculated? if so leave.
m->readPlyInfoFromDatabase(curState.layerNumber, curState.stateNumber, plyInfo);
if (plyInfo != PLYINFO_VALUE_UNCALCULATED) return TM_RETURN_VALUE_OK;
if (plyInfo != PLYINFO_VALUE_UNCALCULATED)
return TM_RETURN_VALUE_OK;
// set current selected situation
if (m->setSituation(rabVars->curThreadNo, curState.layerNumber, curState.stateNumber)) {
if (m->setSituation(rabVars->curThreadNo, curState.layerNumber, curState.stateNumber))
{
// calc value of situation
m->letTheTreeGrow(&root, rabVars, m->depthOfFullTree, SKV_VALUE_GAME_LOST, SKV_VALUE_GAME_WON);
} else {
}
else
{
// should not occur, because already tested by plyInfo == PLYINFO_VALUE_UNCALCULATED
MessageBoxW(nullptr, L"This event should never occur. if (!m->setSituation())", L"ERROR", MB_OK);
}
@ -324,43 +357,55 @@ void MiniMax::letTheTreeGrow(Node *knot, RunAlphaBetaVars *rabVars, unsigned int
knot->floatValue = (float)knot->shortValue;
// evaluate situation, musn't occur while calculating database
if (tilLevel == 0) {
if (calcDatabase) {
if (tilLevel == 0)
{
if (calcDatabase)
{
// if tilLevel is equal zero it means that memory is gone out, since each recursive step needs memory
PRINT(0, this, "ERROR: tilLevel == 0");
knot->shortValue = SKV_VALUE_INVALID;
knot->plyInfo = PLYINFO_VALUE_INVALID;
knot->floatValue = (float)knot->shortValue;
falseOrStop();
} else {
}
else
{
getValueOfSituation(rabVars->curThreadNo, knot->floatValue, knot->shortValue);
}
// investigate branches
} else {
}
else
{
// get layer and state number of current state and look if short knot value can be found in database or in an array
if (alphaBetaTryDataBase(knot, rabVars, tilLevel, layerNumber, stateNumber)) return;
if (alphaBetaTryDataBase(knot, rabVars, tilLevel, layerNumber, stateNumber))
return;
// get number of possiblities
idPossibility = getPossibilities(rabVars->curThreadNo, &knot->numPossibilities, &knot->isOpponentLevel, &pPossibilities);
// unable to move
if (knot->numPossibilities == 0) {
if (knot->numPossibilities == 0)
{
// if unable to move a final state is reached
knot->plyInfo = 0;
getValueOfSituation(rabVars->curThreadNo, knot->floatValue, knot->shortValue);
if (tilLevel == depthOfFullTree - 1) rabVars->freqValuesSubMoves[knot->shortValue]++;
if (tilLevel == depthOfFullTree - 1)
rabVars->freqValuesSubMoves[knot->shortValue]++;
// if unable to move an invalid state was reached if nobody has won
if (calcDatabase && knot->shortValue == SKV_VALUE_GAME_DRAWN) {
if (calcDatabase && knot->shortValue == SKV_VALUE_GAME_DRAWN)
{
knot->shortValue = SKV_VALUE_INVALID;
knot->plyInfo = PLYINFO_VALUE_INVALID;
knot->floatValue = (float)knot->shortValue;
}
// movement is possible
} else {
}
else
{
// move, letTreeGroe, undo
alphaBetaTryPossibilites(knot, rabVars, tilLevel, idPossibility, pPossibilities, maxWonfreqValuesSubMoves, alpha, beta);
@ -376,7 +421,8 @@ void MiniMax::letTheTreeGrow(Node *knot, RunAlphaBetaVars *rabVars, unsigned int
}
// save value and best branch into database and set value as valid
if (calcDatabase && hFileShortKnotValues && hFilePlyInfo) alphaBetaSaveInDatabase(rabVars->curThreadNo, layerNumber, stateNumber, knot->shortValue, knot->plyInfo, knot->isOpponentLevel);
if (calcDatabase && hFileShortKnotValues && hFilePlyInfo)
alphaBetaSaveInDatabase(rabVars->curThreadNo, layerNumber, stateNumber, knot->shortValue, knot->plyInfo, knot->isOpponentLevel);
}
}
@ -396,7 +442,8 @@ bool MiniMax::alphaBetaTryDataBase(Node *knot, RunAlphaBetaVars *rabVars, unsign
PlyInfoVarType plyInfo = PLYINFO_VALUE_UNCALCULATED;
// use database ?
if (hFilePlyInfo != nullptr && hFileShortKnotValues != nullptr && (calcDatabase || layerInDatabase)) {
if (hFilePlyInfo != nullptr && hFileShortKnotValues != nullptr && (calcDatabase || layerInDatabase))
{
// situation already existend in database ?
readKnotValueFromDatabase(rabVars->curThreadNo, layerNumber, stateNumber, shortKnotValue, invalidLayerOrStateNumber, subLayerInDatabaseAndCompleted);
@ -404,9 +451,8 @@ bool MiniMax::alphaBetaTryDataBase(Node *knot, RunAlphaBetaVars *rabVars, unsign
// it was possible to achieve an invalid state using move(),
// so the original state was an invalid one
if ((tilLevel < depthOfFullTree && invalidLayerOrStateNumber)
|| (tilLevel < depthOfFullTree && shortKnotValue == SKV_VALUE_INVALID && subLayerInDatabaseAndCompleted)
|| (tilLevel < depthOfFullTree && shortKnotValue == SKV_VALUE_INVALID && plyInfo != PLYINFO_VALUE_UNCALCULATED)) { // version 22: replaced: curCalculatedLayer == layerNumber && knot->plyInfo != PLYINFO_VALUE_UNCALCULATED)) {
if ((tilLevel < depthOfFullTree && invalidLayerOrStateNumber) || (tilLevel < depthOfFullTree && shortKnotValue == SKV_VALUE_INVALID && subLayerInDatabaseAndCompleted) || (tilLevel < depthOfFullTree && shortKnotValue == SKV_VALUE_INVALID && plyInfo != PLYINFO_VALUE_UNCALCULATED))
{ // version 22: replaced: curCalculatedLayer == layerNumber && knot->plyInfo != PLYINFO_VALUE_UNCALCULATED)) {
knot->shortValue = SKV_VALUE_INVALID;
knot->plyInfo = PLYINFO_VALUE_INVALID;
knot->floatValue = (float)knot->shortValue;
@ -414,17 +460,20 @@ bool MiniMax::alphaBetaTryDataBase(Node *knot, RunAlphaBetaVars *rabVars, unsign
}
// print out put, if not calculating database, but requesting a knot value
if (shortKnotValue != SKV_VALUE_INVALID && tilLevel == depthOfFullTree && !calcDatabase && subLayerInDatabaseAndCompleted) {
if (shortKnotValue != SKV_VALUE_INVALID && tilLevel == depthOfFullTree && !calcDatabase && subLayerInDatabaseAndCompleted)
{
PRINT(2, this, "This state is marked as " << ((shortKnotValue == SKV_VALUE_GAME_WON) ? "WON" : ((shortKnotValue == SKV_VALUE_GAME_LOST) ? "LOST" : ((shortKnotValue == SKV_VALUE_GAME_DRAWN) ? "DRAW" : "INVALID"))) << endl);
}
// when knot value is valid then return best branch
if (calcDatabase && tilLevel < depthOfFullTree && shortKnotValue != SKV_VALUE_INVALID && plyInfo != PLYINFO_VALUE_UNCALCULATED
|| !calcDatabase && tilLevel < depthOfFullTree - 1 && shortKnotValue != SKV_VALUE_INVALID) {
if (calcDatabase && tilLevel < depthOfFullTree && shortKnotValue != SKV_VALUE_INVALID && plyInfo != PLYINFO_VALUE_UNCALCULATED || !calcDatabase && tilLevel < depthOfFullTree - 1 && shortKnotValue != SKV_VALUE_INVALID)
{
// switch if is not opponent level
if (knot->isOpponentLevel) knot->shortValue = skvPerspectiveMatrix[shortKnotValue][PL_TO_MOVE_UNCHANGED];
else knot->shortValue = skvPerspectiveMatrix[shortKnotValue][PL_TO_MOVE_CHANGED];
if (knot->isOpponentLevel)
knot->shortValue = skvPerspectiveMatrix[shortKnotValue][PL_TO_MOVE_UNCHANGED];
else
knot->shortValue = skvPerspectiveMatrix[shortKnotValue][PL_TO_MOVE_CHANGED];
knot->floatValue = (float)knot->shortValue;
knot->plyInfo = plyInfo;
return true;
@ -443,10 +492,12 @@ void MiniMax::alphaBetaTryPossibilites(Node *knot, RunAlphaBetaVars *rabVars, un
void *pBackup;
unsigned int curPoss;
for (curPoss = 0; curPoss < knot->numPossibilities; curPoss++) {
for (curPoss = 0; curPoss < knot->numPossibilities; curPoss++)
{
// output
if (tilLevel == depthOfFullTree && !calcDatabase) {
if (tilLevel == depthOfFullTree && !calcDatabase)
{
printMoveInformation(rabVars->curThreadNo, idPossibility[curPoss], pPossibilities);
rabVars->freqValuesSubMoves[SKV_VALUE_INVALID] = 0;
rabVars->freqValuesSubMoves[SKV_VALUE_GAME_LOST] = 0;
@ -464,47 +515,68 @@ void MiniMax::alphaBetaTryPossibilites(Node *knot, RunAlphaBetaVars *rabVars, un
undo(rabVars->curThreadNo, idPossibility[curPoss], knot->isOpponentLevel, pBackup, pPossibilities);
// output
if (tilLevel == depthOfFullTree && !calcDatabase) {
if (tilLevel == depthOfFullTree && !calcDatabase)
{
rabVars->freqValuesSubMovesBranchWon[curPoss] = rabVars->freqValuesSubMoves[SKV_VALUE_GAME_WON];
if (rabVars->freqValuesSubMoves[SKV_VALUE_GAME_WON] > maxWonfreqValuesSubMoves && knot->branches[curPoss].shortValue == SKV_VALUE_GAME_DRAWN) {
if (rabVars->freqValuesSubMoves[SKV_VALUE_GAME_WON] > maxWonfreqValuesSubMoves && knot->branches[curPoss].shortValue == SKV_VALUE_GAME_DRAWN)
{
maxWonfreqValuesSubMoves = rabVars->freqValuesSubMoves[SKV_VALUE_GAME_WON];
}
if (hFileShortKnotValues != nullptr && layerInDatabase) {
if (hFileShortKnotValues != nullptr && layerInDatabase)
{
storeValueOfMove(rabVars->curThreadNo, idPossibility[curPoss], pPossibilities, knot->branches[curPoss].shortValue, rabVars->freqValuesSubMoves, knot->branches[curPoss].plyInfo);
PRINT(0, this, "\t: " << ((knot->branches[curPoss].shortValue == SKV_VALUE_GAME_WON) ? "WON" : ((knot->branches[curPoss].shortValue == SKV_VALUE_GAME_LOST) ? "LOST" : ((knot->branches[curPoss].shortValue == SKV_VALUE_GAME_DRAWN) ? "DRAW" : "INVALID"))) << endl);
} else {
}
else
{
PRINT(0, this, "\t: " << knot->branches[curPoss].floatValue << endl);
}
} else if (tilLevel == depthOfFullTree - 1 && !calcDatabase) {
}
else if (tilLevel == depthOfFullTree - 1 && !calcDatabase)
{
rabVars->freqValuesSubMoves[knot->branches[curPoss].shortValue]++;
}
// don't use alpha beta if using database
if (hFileShortKnotValues != nullptr && calcDatabase) continue;
if (hFileShortKnotValues != nullptr && tilLevel + 1 >= depthOfFullTree) continue;
if (hFileShortKnotValues != nullptr && calcDatabase)
continue;
if (hFileShortKnotValues != nullptr && tilLevel + 1 >= depthOfFullTree)
continue;
// alpha beta algorithmn
if (!knot->isOpponentLevel) {
if (knot->branches[curPoss].floatValue >= beta) {
if (!knot->isOpponentLevel)
{
if (knot->branches[curPoss].floatValue >= beta)
{
knot->numPossibilities = curPoss + 1;
break;
} else if (knot->branches[curPoss].floatValue > alpha) {
}
else if (knot->branches[curPoss].floatValue > alpha)
{
alpha = knot->branches[curPoss].floatValue;
}
} else {
if (knot->branches[curPoss].floatValue <= alpha) {
}
else
{
if (knot->branches[curPoss].floatValue <= alpha)
{
knot->numPossibilities = curPoss + 1;
break;
} else if (knot->branches[curPoss].floatValue < beta) {
}
else if (knot->branches[curPoss].floatValue < beta)
{
beta = knot->branches[curPoss].floatValue;
}
}
}
// let delete pPossibilities
if (tilLevel < depthOfFullTree) {
if (tilLevel < depthOfFullTree)
{
deletePossibilities(rabVars->curThreadNo, pPossibilities);
} else {
}
else
{
pRootPossibilities = pPossibilities;
}
}
@ -521,18 +593,25 @@ void MiniMax::alphaBetaCalcKnotValue(Node *knot)
unsigned int i;
// opponent tries to minimize the value
if (knot->isOpponentLevel) {
for (i = 1; i < knot->numPossibilities; i++) {
if (knot->isOpponentLevel)
{
for (i = 1; i < knot->numPossibilities; i++)
{
// version 21: it should be impossible that knot->shortValue is equal SKV_VALUE_INVALID
if (/*knot->shortValue != SKV_VALUE_INVALID && */knot->branches[i].floatValue < maxValue) {
if (/*knot->shortValue != SKV_VALUE_INVALID && */ knot->branches[i].floatValue < maxValue)
{
maxValue = knot->branches[i].floatValue;
maxBranch = i;
}
}
// maximize the value
} else {
for (i = 1; i < knot->numPossibilities; i++) {
if (/*knot->shortValue != SKV_VALUE_INVALID && */knot->branches[i].floatValue > maxValue) {
}
else
{
for (i = 1; i < knot->numPossibilities; i++)
{
if (/*knot->shortValue != SKV_VALUE_INVALID && */ knot->branches[i].floatValue > maxValue)
{
maxValue = knot->branches[i].floatValue;
maxBranch = i;
}
@ -557,11 +636,16 @@ void MiniMax::alphaBetaCalcPlyInfo(Node *knot)
TwoBit shortKnotValue;
//
if (knot->shortValue == SKV_VALUE_GAME_DRAWN) {
if (knot->shortValue == SKV_VALUE_GAME_DRAWN)
{
knot->plyInfo = PLYINFO_VALUE_DRAWN;
} else if (knot->shortValue == SKV_VALUE_INVALID) {
}
else if (knot->shortValue == SKV_VALUE_INVALID)
{
knot->plyInfo = PLYINFO_VALUE_INVALID;
} else {
}
else
{
// calculate value of knot
shortKnotValue = (knot->isOpponentLevel) ? skvPerspectiveMatrix[knot->shortValue][PL_TO_MOVE_UNCHANGED] : knot->shortValue;
@ -569,9 +653,11 @@ void MiniMax::alphaBetaCalcPlyInfo(Node *knot)
maxBranch = 0;
// when current knot is a won state
if (shortKnotValue == SKV_VALUE_GAME_WON) {
if (shortKnotValue == SKV_VALUE_GAME_WON)
{
for (i = 0; i < knot->numPossibilities; i++) {
for (i = 0; i < knot->numPossibilities; i++)
{
// invert knot value if necessary
shortKnotValue = (knot->branches[i].isOpponentLevel) ? skvPerspectiveMatrix[knot->branches[i].shortValue][PL_TO_MOVE_UNCHANGED] : knot->branches[i].shortValue;
@ -580,7 +666,8 @@ void MiniMax::alphaBetaCalcPlyInfo(Node *knot)
if ((knot->branches[i].plyInfo < maxPlyInfo && shortKnotValue == SKV_VALUE_GAME_LOST && knot->isOpponentLevel != knot->branches[i].isOpponentLevel)
// after this move the same player will continue, so take the minimum of the won states
|| (knot->branches[i].plyInfo < maxPlyInfo && shortKnotValue == SKV_VALUE_GAME_WON && knot->isOpponentLevel == knot->branches[i].isOpponentLevel)) {
|| (knot->branches[i].plyInfo < maxPlyInfo && shortKnotValue == SKV_VALUE_GAME_WON && knot->isOpponentLevel == knot->branches[i].isOpponentLevel))
{
maxPlyInfo = knot->branches[i].plyInfo;
maxBranch = i;
@ -588,9 +675,12 @@ void MiniMax::alphaBetaCalcPlyInfo(Node *knot)
}
// current state is a lost state
} else {
}
else
{
for (i = 0; i < knot->numPossibilities; i++) {
for (i = 0; i < knot->numPossibilities; i++)
{
// invert knot value if necessary
shortKnotValue = (knot->branches[i].isOpponentLevel) ? skvPerspectiveMatrix[knot->branches[i].shortValue][PL_TO_MOVE_UNCHANGED] : knot->branches[i].shortValue;
@ -599,7 +689,8 @@ void MiniMax::alphaBetaCalcPlyInfo(Node *knot)
if ((knot->branches[i].plyInfo > maxPlyInfo && shortKnotValue == SKV_VALUE_GAME_WON && knot->isOpponentLevel != knot->branches[i].isOpponentLevel)
// take the maximum of the won states, since that's the longest path
|| (knot->branches[i].plyInfo > maxPlyInfo && shortKnotValue == SKV_VALUE_GAME_LOST && knot->isOpponentLevel == knot->branches[i].isOpponentLevel)) {
|| (knot->branches[i].plyInfo > maxPlyInfo && shortKnotValue == SKV_VALUE_GAME_LOST && knot->isOpponentLevel == knot->branches[i].isOpponentLevel))
{
maxPlyInfo = knot->branches[i].plyInfo;
maxBranch = i;
@ -626,37 +717,49 @@ void MiniMax::alphaBetaChooseBestMove(Node *knot, RunAlphaBetaVars *rabVars, uns
unsigned int maxBranch;
// select randomly one of the best moves, if they are equivalent
if (tilLevel == depthOfFullTree && !calcDatabase) {
if (tilLevel == depthOfFullTree && !calcDatabase)
{
// check every possible move
for (numBestChoices = 0, i = 0; i < knot->numPossibilities; i++) {
for (numBestChoices = 0, i = 0; i < knot->numPossibilities; i++)
{
// use information in database
if (layerInDatabase && hFileShortKnotValues != nullptr) {
if (layerInDatabase && hFileShortKnotValues != nullptr)
{
// selected move with equal knot value
if (knot->branches[i].shortValue == knot->shortValue) {
if (knot->branches[i].shortValue == knot->shortValue)
{
// best move lead to drawn state
if (knot->shortValue == SKV_VALUE_GAME_DRAWN) {
if (maxWonfreqValuesSubMoves == rabVars->freqValuesSubMovesBranchWon[i]) {
if (knot->shortValue == SKV_VALUE_GAME_DRAWN)
{
if (maxWonfreqValuesSubMoves == rabVars->freqValuesSubMovesBranchWon[i])
{
bestBranches[numBestChoices] = i;
numBestChoices++;
}
// best move lead to lost or won state
} else {
if (knot->plyInfo == knot->branches[i].plyInfo + 1) {
}
else
{
if (knot->plyInfo == knot->branches[i].plyInfo + 1)
{
bestBranches[numBestChoices] = i;
numBestChoices++;
}
}
}
// conventionell mini-max algorithm
} else {
}
else
{
dif = knot->branches[i].floatValue - knot->floatValue;
dif = (dif > 0) ? dif : -1.0f * dif;
if (dif < FPKV_THRESHOLD) {
if (dif < FPKV_THRESHOLD)
{
bestBranches[numBestChoices] = i;
numBestChoices++;
}

233
src/perfect/miniMax_database.cpp
View File

@ -15,7 +15,8 @@
void MiniMax::closeDatabase()
{
// close database
if (hFileShortKnotValues != nullptr) {
if (hFileShortKnotValues != nullptr)
{
unloadAllLayers();
SAFE_DELETE_ARRAY(layerStats);
CloseHandle(hFileShortKnotValues);
@ -23,7 +24,8 @@ void MiniMax::closeDatabase()
}
// close ply information file
if (hFilePlyInfo != nullptr) {
if (hFilePlyInfo != nullptr)
{
unloadAllPlyInfos();
SAFE_DELETE_ARRAY(plyInfos);
CloseHandle(hFilePlyInfo);
@ -63,7 +65,8 @@ void MiniMax::unloadLayer(unsigned int layerNumber)
//-----------------------------------------------------------------------------
void MiniMax::unloadAllPlyInfos()
{
for (unsigned int i = 0; i < plyInfoHeader.numLayers; i++) {
for (unsigned int i = 0; i < plyInfoHeader.numLayers; i++)
{
unloadPlyInfo(i);
}
}
@ -74,7 +77,8 @@ void MiniMax::unloadAllPlyInfos()
//-----------------------------------------------------------------------------
void MiniMax::unloadAllLayers()
{
for (unsigned int i = 0; i < skvfHeader.numLayers; i++) {
for (unsigned int i = 0; i < skvfHeader.numLayers; i++)
{
unloadLayer(i);
}
}
@ -93,17 +97,25 @@ void MiniMax::saveBytesToFile(HANDLE hFile, long long offset, unsigned int numBy
liDistanceToMove.QuadPart = offset;
while (errorPrint = !SetFilePointerEx(hFile, liDistanceToMove, nullptr, FILE_BEGIN)) {
if (!errorPrint) PRINT(1, this, "ERROR: SetFilePointerEx failed!");
while (errorPrint = !SetFilePointerEx(hFile, liDistanceToMove, nullptr, FILE_BEGIN))
{
if (!errorPrint)
PRINT(1, this, "ERROR: SetFilePointerEx failed!");
}
while (restingBytes > 0) {
if (WriteFile(hFile, myPointer, restingBytes, &dwBytesWritten, nullptr) == TRUE) {
while (restingBytes > 0)
{
if (WriteFile(hFile, myPointer, restingBytes, &dwBytesWritten, nullptr) == TRUE)
{
restingBytes -= dwBytesWritten;
myPointer = (void *)(((unsigned char *)myPointer) + dwBytesWritten);
if (restingBytes > 0) PRINT(2, this, "Still " << restingBytes << " to write!");
} else {
if (!errorPrint) PRINT(0, this, "ERROR: WriteFile Failed!");
if (restingBytes > 0)
PRINT(2, this, "Still " << restingBytes << " to write!");
}
else
{
if (!errorPrint)
PRINT(0, this, "ERROR: WriteFile Failed!");
errorPrint = true;
}
}
@ -123,19 +135,27 @@ void MiniMax::loadBytesFromFile(HANDLE hFile, long long offset, unsigned int num
liDistanceToMove.QuadPart = offset;
while (errorPrint = !SetFilePointerEx(hFile, liDistanceToMove, nullptr, FILE_BEGIN)) {
if (!errorPrint) PRINT(0, this, "ERROR: SetFilePointerEx failed!");
while (errorPrint = !SetFilePointerEx(hFile, liDistanceToMove, nullptr, FILE_BEGIN))
{
if (!errorPrint)
PRINT(0, this, "ERROR: SetFilePointerEx failed!");
}
while (restingBytes > 0) {
if (ReadFile(hFile, pBytes, restingBytes, &dwBytesRead, nullptr) == TRUE) {
while (restingBytes > 0)
{
if (ReadFile(hFile, pBytes, restingBytes, &dwBytesRead, nullptr) == TRUE)
{
restingBytes -= dwBytesRead;
myPointer = (void *)(((unsigned char *)myPointer) + dwBytesRead);
if (restingBytes > 0) {
if (restingBytes > 0)
{
PRINT(2, this, "Still " << restingBytes << " bytes to read!");
}
} else {
if (!errorPrint) PRINT(0, this, "ERROR: ReadFile Failed!");
}
else
{
if (!errorPrint)
PRINT(0, this, "ERROR: ReadFile Failed!");
errorPrint = true;
}
}
@ -149,9 +169,12 @@ bool MiniMax::isCurrentStateInDatabase(unsigned int threadNo)
{
unsigned int layerNum, stateNumber;
if (hFileShortKnotValues == nullptr) {
if (hFileShortKnotValues == nullptr)
{
return false;
} else {
}
else
{
getLayerAndStateNumber(threadNo, layerNum, stateNumber);
return layerStats[layerNum].layerIsCompletedAndInFile;
}
@ -187,7 +210,8 @@ void MiniMax::saveHeader(PlyInfoFileHeader *piH, PlyInfo *pInfo)
//-----------------------------------------------------------------------------
bool MiniMax::openDatabase(const char *directory, unsigned int maximumNumberOfBranches)
{
if (strlen(directory) && !PathFileExistsA(directory)) {
if (strlen(directory) && !PathFileExistsA(directory))
{
PRINT(0, this, "ERROR: Database path " << directory << " not valid!");
return falseOrStop();
}
@ -208,7 +232,8 @@ void MiniMax::openSkvFile(const char *directory, unsigned int maximumNumberOfBra
unsigned int i;
// don't open file twice
if (hFileShortKnotValues != nullptr) return;
if (hFileShortKnotValues != nullptr)
return;
// remember directory name
fileDirectory.assign(directory);
@ -219,7 +244,8 @@ void MiniMax::openSkvFile(const char *directory, unsigned int maximumNumberOfBra
hFileShortKnotValues = CreateFileA(ssDatabaseFile.str().c_str(), GENERIC_READ | GENERIC_WRITE, FILE_SHARE_READ | FILE_SHARE_WRITE, nullptr, OPEN_ALWAYS, FILE_ATTRIBUTE_NORMAL, nullptr);
// opened file succesfully
if (hFileShortKnotValues == INVALID_HANDLE_VALUE) {
if (hFileShortKnotValues == INVALID_HANDLE_VALUE)
{
hFileShortKnotValues = nullptr;
return;
}
@ -232,7 +258,8 @@ void MiniMax::openSkvFile(const char *directory, unsigned int maximumNumberOfBra
ReadFile(hFileShortKnotValues, &skvfHeader, sizeof(SkvFileHeader), &dwBytesRead, nullptr);
// invalid file ?
if (dwBytesRead != sizeof(SkvFileHeader) || skvfHeader.headerCode != SKV_FILE_HEADER_CODE) {
if (dwBytesRead != sizeof(SkvFileHeader) || skvfHeader.headerCode != SKV_FILE_HEADER_CODE)
{
// create default header
skvfHeader.completed = false;
@ -242,7 +269,8 @@ void MiniMax::openSkvFile(const char *directory, unsigned int maximumNumberOfBra
layerStats = new LayerStats[skvfHeader.numLayers];
layerStats[0].layerOffset = 0;
for (i = 0; i < skvfHeader.numLayers; i++) {
for (i = 0; i < skvfHeader.numLayers; i++)
{
getSuccLayers(i, &layerStats[i].numSuccLayers, &layerStats[i].succLayers[0]);
layerStats[i].partnerLayer = getPartnerLayer(i);
layerStats[i].knotsInLayer = getNumberOfKnotsInLayer(i);
@ -257,7 +285,8 @@ void MiniMax::openSkvFile(const char *directory, unsigned int maximumNumberOfBra
layerStats[i].numInvalidStates = 0;
}
for (i = 1; i < skvfHeader.numLayers; i++) {
for (i = 1; i < skvfHeader.numLayers; i++)
{
layerStats[i].layerOffset = layerStats[i - 1].layerOffset + layerStats[i - 1].sizeInBytes;
}
@ -265,10 +294,13 @@ void MiniMax::openSkvFile(const char *directory, unsigned int maximumNumberOfBra
saveHeader(&skvfHeader, layerStats);
// read layer stats
} else {
}
else
{
layerStats = new LayerStats[skvfHeader.numLayers];
ReadFile(hFileShortKnotValues, layerStats, sizeof(LayerStats) * skvfHeader.numLayers, &dwBytesRead, nullptr);
for (i = 0; i < skvfHeader.numLayers; i++) {
for (i = 0; i < skvfHeader.numLayers; i++)
{
layerStats[i].shortKnotValueByte = nullptr;
layerStats[i].skvCompressed = nullptr;
}
@ -287,17 +319,20 @@ void MiniMax::openPlyInfoFile(const char *directory)
unsigned int i;
// don't open file twice
if (hFilePlyInfo != nullptr) return;
if (hFilePlyInfo != nullptr)
return;
// remember directory name
ssFile << directory << (strlen(directory) ? "\\" : "") << "plyInfo.dat";
PRINT(2, this, "Open ply info file: " << ssFile.str() << endl << endl);
PRINT(2, this, "Open ply info file: " << ssFile.str() << endl
<< endl);
// Open Database-File (FILE_FLAG_NO_BUFFERING | FILE_FLAG_WRITE_THROUGH | FILE_FLAG_RANDOM_ACCESS)
hFilePlyInfo = CreateFileA(ssFile.str().c_str(), GENERIC_READ | GENERIC_WRITE, FILE_SHARE_READ | FILE_SHARE_WRITE, nullptr, OPEN_ALWAYS, FILE_ATTRIBUTE_NORMAL, nullptr);
// opened file succesfully
if (hFilePlyInfo == INVALID_HANDLE_VALUE) {
if (hFilePlyInfo == INVALID_HANDLE_VALUE)
{
hFilePlyInfo = nullptr;
return;
}
@ -309,7 +344,8 @@ void MiniMax::openPlyInfoFile(const char *directory)
ReadFile(hFilePlyInfo, &plyInfoHeader, sizeof(plyInfoHeader), &dwBytesRead, nullptr);
// invalid file ?
if (dwBytesRead != sizeof(plyInfoHeader) || plyInfoHeader.headerCode != PLYINFO_HEADER_CODE) {
if (dwBytesRead != sizeof(plyInfoHeader) || plyInfoHeader.headerCode != PLYINFO_HEADER_CODE)
{
// create default header
plyInfoHeader.plyInfoCompleted = false;
@ -319,7 +355,8 @@ void MiniMax::openPlyInfoFile(const char *directory)
plyInfos = new PlyInfo[plyInfoHeader.numLayers];
plyInfos[0].layerOffset = 0;
for (i = 0; i < plyInfoHeader.numLayers; i++) {
for (i = 0; i < plyInfoHeader.numLayers; i++)
{
plyInfos[i].knotsInLayer = getNumberOfKnotsInLayer(i);
plyInfos[i].plyInfo = nullptr;
plyInfos[i].plyInfoCompressed = nullptr;
@ -328,7 +365,8 @@ void MiniMax::openPlyInfoFile(const char *directory)
plyInfos[i].sizeInBytes = plyInfos[i].knotsInLayer * sizeof(PlyInfoVarType);
}
for (i = 1; i < plyInfoHeader.numLayers; i++) {
for (i = 1; i < plyInfoHeader.numLayers; i++)
{
plyInfos[i].layerOffset = plyInfos[i - 1].layerOffset + plyInfos[i - 1].sizeInBytes;
}
@ -336,10 +374,13 @@ void MiniMax::openPlyInfoFile(const char *directory)
saveHeader(&plyInfoHeader, plyInfos);
// read layer stats
} else {
}
else
{
plyInfos = new PlyInfo[plyInfoHeader.numLayers];
ReadFile(hFilePlyInfo, plyInfos, sizeof(PlyInfo) * plyInfoHeader.numLayers, &dwBytesRead, nullptr);
for (i = 0; i < plyInfoHeader.numLayers; i++) {
for (i = 0; i < plyInfoHeader.numLayers; i++)
{
plyInfos[i].plyInfo = nullptr;
plyInfos[i].plyInfoCompressed = nullptr;
}
@ -355,10 +396,12 @@ void MiniMax::saveLayerToFile(unsigned int layerNumber)
// don't save layer and header when only preparing layers
PlyInfo *myPis = &plyInfos[layerNumber];
LayerStats *myLss = &layerStats[layerNumber];
if (onlyPrepareLayer) return;
if (onlyPrepareLayer)
return;
// save layer if there are any states
if (myLss->sizeInBytes) {
if (myLss->sizeInBytes)
{
// short knot values & ply info
curCalculationActionId = MM_ACTION_SAVING_LAYER_TO_FILE;
@ -380,21 +423,26 @@ inline void MiniMax::measureIops(long long &numOperations, LARGE_INTEGER &interv
// locals
LARGE_INTEGER curTimeAfter;
if (!MEASURE_IOPS) return;
if (!MEASURE_IOPS)
return;
numOperations++; // ... not thread-safe !!!
// only the time for the io-operation is considered and accumulated
if (MEASURE_ONLY_IO) {
if (MEASURE_ONLY_IO)
{
QueryPerformanceCounter(&curTimeAfter);
interval.QuadPart += curTimeAfter.QuadPart - curTimeBefore.QuadPart; // ... not thread-safe !!!
double totalTimeGone = (double)interval.QuadPart / frequency.QuadPart; // ... not thread-safe !!!
if (totalTimeGone >= 5.0) {
if (totalTimeGone >= 5.0)
{
PRINT(0, this, text << "operations per second for last interval: " << (int)(numOperations / totalTimeGone));
interval.QuadPart = 0; // ... not thread-safe !!!
numOperations = 0; // ... not thread-safe !!!
}
// the whole time passed since the beginning of the interval is considered
} else if (numOperations >= MEASURE_TIME_FREQUENCY) {
}
else if (numOperations >= MEASURE_TIME_FREQUENCY)
{
QueryPerformanceCounter(&curTimeAfter);
double totalTimeGone = (double)(curTimeAfter.QuadPart - interval.QuadPart) / frequency.QuadPart; // ... not thread-safe !!!
PRINT(0, this, text << "operations per second for last interval: " << numOperations / totalTimeGone);
@ -417,13 +465,17 @@ void MiniMax::readKnotValueFromDatabase(unsigned int threadNo, unsigned int &lay
layerInDatabaseAndCompleted = myLss->layerIsCompletedAndInFile;
// valid state and layer number ?
if (layerNumber > skvfHeader.numLayers || stateNumber > myLss->knotsInLayer) {
if (layerNumber > skvfHeader.numLayers || stateNumber > myLss->knotsInLayer)
{
invalidLayerOrStateNumber = true;
} else {
}
else
{
invalidLayerOrStateNumber = false; // checkStateIntegrity();
}
if (invalidLayerOrStateNumber) {
if (invalidLayerOrStateNumber)
{
knotValue = SKV_VALUE_INVALID;
return;
}
@ -445,29 +497,38 @@ void MiniMax::readKnotValueFromDatabase(unsigned int layerNumber, unsigned int s
LayerStats *myLss = &layerStats[layerNumber];
// valid state and layer number ?
if (layerNumber > skvfHeader.numLayers || stateNumber > myLss->knotsInLayer) {
if (layerNumber > skvfHeader.numLayers || stateNumber > myLss->knotsInLayer)
{
PRINT(0, this, "ERROR: INVALID layerNumber OR stateNumber in readKnotValueFromDatabase()!");
knotValue = SKV_VALUE_INVALID;
return;
}
// if database is complete get whole byte from file
if (skvfHeader.completed || layerInDatabase || myLss->layerIsCompletedAndInFile) {
if (skvfHeader.completed || layerInDatabase || myLss->layerIsCompletedAndInFile)
{
EnterCriticalSection(&csDatabase);
loadBytesFromFile(hFileShortKnotValues, skvfHeader.headerAndStatsSize + myLss->layerOffset + stateNumber / 4, 1, &databaseByte);
LeaveCriticalSection(&csDatabase);
} else {
}
else
{
// is layer already loaded
if (!myLss->layerIsLoaded) {
if (!myLss->layerIsLoaded)
{
EnterCriticalSection(&csDatabase);
if (!myLss->layerIsLoaded) {
if (!myLss->layerIsLoaded)
{
// if layer is in database and completed, then load layer from file into memory, set default value otherwise
myLss->shortKnotValueByte = new unsigned char[myLss->sizeInBytes];
if (myLss->layerIsCompletedAndInFile) {
if (myLss->layerIsCompletedAndInFile)
{
loadBytesFromFile(hFileShortKnotValues, skvfHeader.headerAndStatsSize + myLss->layerOffset, myLss->sizeInBytes, myLss->shortKnotValueByte);
} else {
}
else
{
memset(myLss->shortKnotValueByte, SKV_WHOLE_BYTE_IS_INVALID, myLss->sizeInBytes);
}
bytesAllocated = myLss->sizeInBytes;
@ -483,7 +544,8 @@ void MiniMax::readKnotValueFromDatabase(unsigned int layerNumber, unsigned int s
// measure io-operations per second
LARGE_INTEGER curTimeBefore;
if (MEASURE_IOPS && MEASURE_ONLY_IO) {
if (MEASURE_IOPS && MEASURE_ONLY_IO)
{
QueryPerformanceCounter(&curTimeBefore);
}
@ -511,29 +573,39 @@ void MiniMax::readPlyInfoFromDatabase(unsigned int layerNumber, unsigned int sta
PlyInfo *myPis = &plyInfos[layerNumber];
// valid state and layer number ?
if (layerNumber > plyInfoHeader.numLayers || stateNumber > myPis->knotsInLayer) {
if (layerNumber > plyInfoHeader.numLayers || stateNumber > myPis->knotsInLayer)
{
PRINT(0, this, "ERROR: INVALID layerNumber OR stateNumber in readPlyInfoFromDatabase()!");
value = PLYINFO_VALUE_INVALID;
return;
}
// if database is complete get whole byte from file
if (plyInfoHeader.plyInfoCompleted || layerInDatabase || myPis->plyInfoIsCompletedAndInFile) {
if (plyInfoHeader.plyInfoCompleted || layerInDatabase || myPis->plyInfoIsCompletedAndInFile)
{
EnterCriticalSection(&csDatabase);
loadBytesFromFile(hFilePlyInfo, plyInfoHeader.headerAndPlyInfosSize + myPis->layerOffset + sizeof(PlyInfoVarType) * stateNumber, sizeof(PlyInfoVarType), &value);
LeaveCriticalSection(&csDatabase);
} else {
}
else
{
// is layer already in memory?
if (!myPis->plyInfoIsLoaded) {
if (!myPis->plyInfoIsLoaded)
{
EnterCriticalSection(&csDatabase);
if (!myPis->plyInfoIsLoaded) {
if (!myPis->plyInfoIsLoaded)
{
// if layer is in database and completed, then load layer from file into memory; set default value otherwise
myPis->plyInfo = new PlyInfoVarType[myPis->knotsInLayer];
if (myPis->plyInfoIsCompletedAndInFile) {
if (myPis->plyInfoIsCompletedAndInFile)
{
loadBytesFromFile(hFilePlyInfo, plyInfoHeader.headerAndPlyInfosSize + myPis->layerOffset, myPis->sizeInBytes, myPis->plyInfo);
} else {
for (curKnot = 0; curKnot < myPis->knotsInLayer; curKnot++) {
}
else
{
for (curKnot = 0; curKnot < myPis->knotsInLayer; curKnot++)
{
myPis->plyInfo[curKnot] = defValue;
}
}
@ -548,7 +620,8 @@ void MiniMax::readPlyInfoFromDatabase(unsigned int layerNumber, unsigned int sta
// measure io-operations per second
LARGE_INTEGER curTimeBefore;
if (MEASURE_IOPS && MEASURE_ONLY_IO) {
if (MEASURE_IOPS && MEASURE_ONLY_IO)
{
QueryPerformanceCounter(&curTimeBefore);
}
@ -572,22 +645,26 @@ void MiniMax::saveKnotValueInDatabase(unsigned int layerNumber, unsigned int sta
LayerStats *myLss = &layerStats[layerNumber];
// valid state and layer number ?
if (layerNumber > skvfHeader.numLayers || stateNumber > myLss->knotsInLayer) {
if (layerNumber > skvfHeader.numLayers || stateNumber > myLss->knotsInLayer)
{
PRINT(0, this, "ERROR: INVALID layerNumber OR stateNumber in saveKnotValueInDatabase()!");
return;
}
// is layer already completed ?
if (myLss->layerIsCompletedAndInFile) {
if (myLss->layerIsCompletedAndInFile)
{
PRINT(0, this, "ERROR: layer already completed and in file! function: saveKnotValueInDatabase()!");
return;
}
// is layer already loaded?
if (!myLss->layerIsLoaded) {
if (!myLss->layerIsLoaded)
{
EnterCriticalSection(&csDatabase);
if (!myLss->layerIsLoaded) {
if (!myLss->layerIsLoaded)
{
// reserve memory for this layer & create array for ply info with default value
myLss->shortKnotValueByte = new TwoBit[myLss->sizeInBytes];
memset(myLss->shortKnotValueByte, SKV_WHOLE_BYTE_IS_INVALID, myLss->sizeInBytes);
@ -604,7 +681,8 @@ void MiniMax::saveKnotValueInDatabase(unsigned int layerNumber, unsigned int sta
// measure io-operations per second
LARGE_INTEGER curTimeBefore;
if (MEASURE_IOPS && MEASURE_ONLY_IO) {
if (MEASURE_IOPS && MEASURE_ONLY_IO)
{
QueryPerformanceCounter(&curTimeBefore);
}
@ -614,7 +692,8 @@ void MiniMax::saveKnotValueInDatabase(unsigned int layerNumber, unsigned int sta
long mask = 0x00000003 << numBitsToShift;
long curShortKnotValueLong, newShortKnotValueLong;
do {
do
{
curShortKnotValueLong = *pShortKnotValue;
newShortKnotValueLong = (curShortKnotValueLong & (~mask)) + (knotValue << numBitsToShift);
} while (InterlockedCompareExchange(pShortKnotValue, newShortKnotValueLong, curShortKnotValueLong) != curShortKnotValueLong);
@ -636,25 +715,30 @@ void MiniMax::savePlyInfoInDatabase(unsigned int layerNumber, unsigned int state
PlyInfo *myPis = &plyInfos[layerNumber];
// valid state and layer number ?
if (layerNumber > plyInfoHeader.numLayers || stateNumber > myPis->knotsInLayer) {
if (layerNumber > plyInfoHeader.numLayers || stateNumber > myPis->knotsInLayer)
{
PRINT(0, this, "ERROR: INVALID layerNumber OR stateNumber in savePlyInfoInDatabase()!");
return;
}
// is layer already completed ?
if (myPis->plyInfoIsCompletedAndInFile) {
if (myPis->plyInfoIsCompletedAndInFile)
{
PRINT(0, this, "ERROR: layer already completed and in file! function: savePlyInfoInDatabase()!");
return;
}
// is layer already loaded
if (!myPis->plyInfoIsLoaded) {
if (!myPis->plyInfoIsLoaded)
{
EnterCriticalSection(&csDatabase);
if (!myPis->plyInfoIsLoaded) {
if (!myPis->plyInfoIsLoaded)
{
// reserve memory for this layer & create array for ply info with default value
myPis->plyInfo = new PlyInfoVarType[myPis->knotsInLayer];
for (curKnot = 0; curKnot < myPis->knotsInLayer; curKnot++) {
for (curKnot = 0; curKnot < myPis->knotsInLayer; curKnot++)
{
myPis->plyInfo[curKnot] = defValue;
}
bytesAllocated = myPis->sizeInBytes;
@ -668,7 +752,8 @@ void MiniMax::savePlyInfoInDatabase(unsigned int layerNumber, unsigned int state
// measure io-operations per second
LARGE_INTEGER curTimeBefore;
if (MEASURE_IOPS && MEASURE_ONLY_IO) {
if (MEASURE_IOPS && MEASURE_ONLY_IO)
{
QueryPerformanceCounter(&curTimeBefore);
}

328
src/perfect/miniMax_retroAnalysis.cpp
View File

@ -30,7 +30,8 @@ bool MiniMax::calcKnotValuesByRetroAnalysis(vector<unsigned int> &layersToCalcul
// init retro vars
retroVars.thread.resize(threadManager.getNumThreads());
for (threadNo = 0; threadNo < threadManager.getNumThreads(); threadNo++) {
for (threadNo = 0; threadNo < threadManager.getNumThreads(); threadNo++)
{
retroVars.thread[threadNo].statesToProcess.resize(PLYINFO_EXP_VALUE, nullptr);
retroVars.thread[threadNo].numStatesToProcess = 0;
retroVars.thread[threadNo].threadNo = threadNo;
@ -39,65 +40,83 @@ bool MiniMax::calcKnotValuesByRetroAnalysis(vector<unsigned int> &layersToCalcul
retroVars.layerInitialized.resize(skvfHeader.numLayers, false);
retroVars.layersToCalculate = layersToCalculate;
retroVars.pMiniMax = this;
for (retroVars.totalNumKnots = 0, retroVars.numKnotsToCalc = 0, curLayer = 0; curLayer < layersToCalculate.size(); curLayer++) {
for (retroVars.totalNumKnots = 0, retroVars.numKnotsToCalc = 0, curLayer = 0; curLayer < layersToCalculate.size(); curLayer++)
{
retroVars.numKnotsToCalc += layerStats[layersToCalculate[curLayer]].knotsInLayer;
retroVars.totalNumKnots += layerStats[layersToCalculate[curLayer]].knotsInLayer;
retroVars.layerInitialized[layersToCalculate[curLayer]] = true;
for (curSubLayer = 0; curSubLayer < layerStats[layersToCalculate[curLayer]].numSuccLayers; curSubLayer++) {
if (retroVars.layerInitialized[layerStats[layersToCalculate[curLayer]].succLayers[curSubLayer]]) continue;
else retroVars.layerInitialized[layerStats[layersToCalculate[curLayer]].succLayers[curSubLayer]] = true;
for (curSubLayer = 0; curSubLayer < layerStats[layersToCalculate[curLayer]].numSuccLayers; curSubLayer++)
{
if (retroVars.layerInitialized[layerStats[layersToCalculate[curLayer]].succLayers[curSubLayer]])
continue;
else
retroVars.layerInitialized[layerStats[layersToCalculate[curLayer]].succLayers[curSubLayer]] = true;
retroVars.totalNumKnots += layerStats[layerStats[layersToCalculate[curLayer]].succLayers[curSubLayer]].knotsInLayer;
}
}
retroVars.layerInitialized.assign(skvfHeader.numLayers, false);
// output & filenames
for (curLayer = 0; curLayer < layersToCalculate.size(); curLayer++) ssLayers << " " << layersToCalculate[curLayer];
for (curLayer = 0; curLayer < layersToCalculate.size(); curLayer++)
ssLayers << " " << layersToCalculate[curLayer];
PRINT(0, this, "*** Calculate layers" << ssLayers.str() << " by retro analysis ***");
// initialization
PRINT(2, this, " Bytes in memory: " << memoryUsed2 << endl);
if (!initRetroAnalysis(retroVars)) {
abortCalculation = true; goto freeMem;
if (!initRetroAnalysis(retroVars))
{
abortCalculation = true;
goto freeMem;
}
// prepare count arrays
PRINT(2, this, " Bytes in memory: " << memoryUsed2 << endl);
if (!prepareCountArrays(retroVars)) {
abortCalculation = true; goto freeMem;
if (!prepareCountArrays(retroVars))
{
abortCalculation = true;
goto freeMem;
}
// stop here if only preparing layer
if (onlyPrepareLayer) goto freeMem;
if (onlyPrepareLayer)
goto freeMem;
// iteration
PRINT(2, this, " Bytes in memory: " << memoryUsed2 << endl);
if (!performRetroAnalysis(retroVars)) {
abortCalculation = true; goto freeMem;
if (!performRetroAnalysis(retroVars))
{
abortCalculation = true;
goto freeMem;
}
// show output
PRINT(2, this, " Bytes in memory: " << memoryUsed2);
for (curLayer = 0; curLayer < layersToCalculate.size(); curLayer++) {
for (curLayer = 0; curLayer < layersToCalculate.size(); curLayer++)
{
showLayerStats(layersToCalculate[curLayer]);
}
PRINT(2, this, "");
// free memory
freeMem:
for (threadNo = 0; threadNo < threadManager.getNumThreads(); threadNo++) {
for (plyCounter = 0; plyCounter < retroVars.thread[threadNo].statesToProcess.size(); plyCounter++) {
for (threadNo = 0; threadNo < threadManager.getNumThreads(); threadNo++)
{
for (plyCounter = 0; plyCounter < retroVars.thread[threadNo].statesToProcess.size(); plyCounter++)
{
SAFE_DELETE(retroVars.thread[threadNo].statesToProcess[plyCounter]);
}
}
for (curLayer = 0; curLayer < layersToCalculate.size(); curLayer++) {
if (retroVars.countArrays[curLayer] != nullptr) {
for (curLayer = 0; curLayer < layersToCalculate.size(); curLayer++)
{
if (retroVars.countArrays[curLayer] != nullptr)
{
memoryUsed2 -= layerStats[layersToCalculate[curLayer]].knotsInLayer * sizeof(CountArrayVarType);
arrayInfos.removeArray(layersToCalculate[curLayer], ArrayInfo::arrayType_countArray, layerStats[layersToCalculate[curLayer]].knotsInLayer * sizeof(CountArrayVarType), 0);
}
SAFE_DELETE_ARRAY(retroVars.countArrays[curLayer]);
}
if (!abortCalculation) PRINT(2, this, " Bytes in memory: " << memoryUsed2);
if (!abortCalculation)
PRINT(2, this, " Bytes in memory: " << memoryUsed2);
return !abortCalculation;
}
@ -116,7 +135,8 @@ bool MiniMax::initRetroAnalysis(retroAnalysisGlobalVars &retroVars)
bool initAlreadyDone = false; // true if the initialization information is already available in a file
// process each layer
for (curLayerId = 0; curLayerId < retroVars.layersToCalculate.size(); curLayerId++) {
for (curLayerId = 0; curLayerId < retroVars.layersToCalculate.size(); curLayerId++)
{
// set current processed layer number
layerNumber = retroVars.layersToCalculate[curLayerId];
@ -124,20 +144,25 @@ bool MiniMax::initRetroAnalysis(retroAnalysisGlobalVars &retroVars)
PRINT(1, this, endl << " *** Initialization of layer " << layerNumber << " (" << (getOutputInformation(layerNumber)) << ") which has " << layerStats[layerNumber].knotsInLayer << " knots ***");
// file names
ssInitArrayPath.str(""); ssInitArrayPath << fileDirectory << (fileDirectory.size() ? "\\" : "") << "initLayer";
ssInitArrayFilePath.str(""); ssInitArrayFilePath << fileDirectory << (fileDirectory.size() ? "\\" : "") << "initLayer\\initLayer" << layerNumber << ".dat";
ssInitArrayPath.str("");
ssInitArrayPath << fileDirectory << (fileDirectory.size() ? "\\" : "") << "initLayer";
ssInitArrayFilePath.str("");
ssInitArrayFilePath << fileDirectory << (fileDirectory.size() ? "\\" : "") << "initLayer\\initLayer" << layerNumber << ".dat";
// does initialization file exist ?
CreateDirectoryA(ssInitArrayPath.str().c_str(), nullptr);
initArray = new BufferedFile(threadManager.getNumThreads(), FILE_BUFFER_SIZE, ssInitArrayFilePath.str().c_str());
if (initArray->getFileSize() == (LONGLONG)layerStats[layerNumber].knotsInLayer) {
if (initArray->getFileSize() == (LONGLONG)layerStats[layerNumber].knotsInLayer)
{
PRINT(2, this, " Loading init states from file: " << ssInitArrayFilePath.str());
initAlreadyDone = true;
}
// don't add layers twice
if (retroVars.layerInitialized[layerNumber]) continue;
else retroVars.layerInitialized[layerNumber] = true;
if (retroVars.layerInitialized[layerNumber])
continue;
else
retroVars.layerInitialized[layerNumber] = true;
// prepare parameters
numStatesProcessed = 0;
@ -148,7 +173,8 @@ bool MiniMax::initRetroAnalysis(retroAnalysisGlobalVars &retroVars)
ThreadManager::ThreadVarsArray<InitRetroAnalysisVars> tva(threadManager.getNumThreads(), InitRetroAnalysisVars(this, &retroVars, layerNumber, initArray, initAlreadyDone));
// process each state in the current layer
switch (threadManager.executeParallelLoop(initRetroAnalysisThreadProc, tva.getPointerToArray(), tva.getSizeOfArray(), TM_SCHEDULE_STATIC, 0, layerStats[layerNumber].knotsInLayer - 1, 1)) {
switch (threadManager.executeParallelLoop(initRetroAnalysisThreadProc, tva.getPointerToArray(), tva.getSizeOfArray(), TM_SCHEDULE_STATIC, 0, layerStats[layerNumber].knotsInLayer - 1, 1))
{
case TM_RETURN_VALUE_OK:
break;
case TM_RETURN_VALUE_EXECUTION_CANCELLED:
@ -166,7 +192,8 @@ bool MiniMax::initRetroAnalysis(retroAnalysisGlobalVars &retroVars)
initAlreadyDone = false;
initArray->flushBuffers();
SAFE_DELETE(initArray);
if (numStatesProcessed < layerStats[layerNumber].knotsInLayer) return falseOrStop();
if (numStatesProcessed < layerStats[layerNumber].knotsInLayer)
return falseOrStop();
// when init file was created new then save it now
PRINT(2, this, " Saved initialized states to file: " << ssInitArrayFilePath.str());
@ -198,38 +225,48 @@ DWORD MiniMax::initRetroAnalysisThreadProc(void *pParameter, int index)
iraVars->statesProcessed++;
// print status
if (iraVars->statesProcessed % OUTPUT_EVERY_N_STATES == 0) {
if (iraVars->statesProcessed % OUTPUT_EVERY_N_STATES == 0)
{
m->numStatesProcessed += OUTPUT_EVERY_N_STATES;
PRINT(2, m, "Already initialized " << m->numStatesProcessed << " of " << m->layerStats[curState.layerNumber].knotsInLayer << " states");
}
// layer initialization already done ? if so, then read from file
if (iraVars->initAlreadyDone) {
if (!iraVars->bufferedFile->readBytes(iraVars->curThreadNo, index * sizeof(TwoBit), sizeof(TwoBit), (unsigned char *)&curStateValue)) {
if (iraVars->initAlreadyDone)
{
if (!iraVars->bufferedFile->readBytes(iraVars->curThreadNo, index * sizeof(TwoBit), sizeof(TwoBit), (unsigned char *)&curStateValue))
{
PRINT(0, m, "ERROR: initArray->takeBytes() failed");
return m->falseOrStop();
}
// initialization not done
} else {
}
else
{
// set current selected situation
if (!m->setSituation(iraVars->curThreadNo, curState.layerNumber, curState.stateNumber)) {
if (!m->setSituation(iraVars->curThreadNo, curState.layerNumber, curState.stateNumber))
{
curStateValue = SKV_VALUE_INVALID;
} else {
}
else
{
// get value of current situation
m->getValueOfSituation(iraVars->curThreadNo, floatValue, curStateValue);
}
}
// save init value
if (curStateValue != SKV_VALUE_INVALID) {
if (curStateValue != SKV_VALUE_INVALID)
{
// save short knot value
m->saveKnotValueInDatabase(curState.layerNumber, curState.stateNumber, curStateValue);
// put in list if state is final
if (curStateValue == SKV_VALUE_GAME_WON || curStateValue == SKV_VALUE_GAME_LOST) {
if (curStateValue == SKV_VALUE_GAME_WON || curStateValue == SKV_VALUE_GAME_LOST)
{
// ply info
m->savePlyInfoInDatabase(curState.layerNumber, curState.stateNumber, 0);
@ -240,9 +277,11 @@ DWORD MiniMax::initRetroAnalysisThreadProc(void *pParameter, int index)
}
// write data to file
if (!iraVars->initAlreadyDone) {
if (!iraVars->initAlreadyDone)
{
// curStateValue sollte 2 sein bei index == 1329322
if (!iraVars->bufferedFile->writeBytes(iraVars->curThreadNo, index * sizeof(TwoBit), sizeof(TwoBit), (unsigned char *)&curStateValue)) {
if (!iraVars->bufferedFile->writeBytes(iraVars->curThreadNo, index * sizeof(TwoBit), sizeof(TwoBit), (unsigned char *)&curStateValue))
{
PRINT(0, m, "ERROR: bufferedFile->writeBytes failed!");
return m->falseOrStop();
}
@ -272,7 +311,8 @@ bool MiniMax::prepareCountArrays(retroAnalysisGlobalVars &retroVars)
stringstream ssLayers;
// output & filenames
for (curLayer = 0; curLayer < retroVars.layersToCalculate.size(); curLayer++) ssLayers << " " << retroVars.layersToCalculate[curLayer];
for (curLayer = 0; curLayer < retroVars.layersToCalculate.size(); curLayer++)
ssLayers << " " << retroVars.layersToCalculate[curLayer];
ssCountArrayPath << fileDirectory << (fileDirectory.size() ? "\\" : "") << "countArray";
ssCountArrayFilePath << fileDirectory << (fileDirectory.size() ? "\\" : "") << "countArray\\countArray" << ssLayers.str() << ".dat";
PRINT(2, this, " *** Prepare count arrays for layers " << ssLayers.str() << " ***" << endl);
@ -280,13 +320,15 @@ bool MiniMax::prepareCountArrays(retroAnalysisGlobalVars &retroVars)
// prepare count arrays
CreateDirectoryA(ssCountArrayPath.str().c_str(), nullptr);
if ((hFileCountArray = CreateFileA(ssCountArrayFilePath.str().c_str(), GENERIC_READ | GENERIC_WRITE, FILE_SHARE_READ | FILE_SHARE_WRITE, nullptr, OPEN_ALWAYS, FILE_ATTRIBUTE_NORMAL, nullptr)) == INVALID_HANDLE_VALUE) {
if ((hFileCountArray = CreateFileA(ssCountArrayFilePath.str().c_str(), GENERIC_READ | GENERIC_WRITE, FILE_SHARE_READ | FILE_SHARE_WRITE, nullptr, OPEN_ALWAYS, FILE_ATTRIBUTE_NORMAL, nullptr)) == INVALID_HANDLE_VALUE)
{
PRINT(0, this, "ERROR: Could not open File " << ssCountArrayFilePath.str() << "!");
return falseOrStop();
}
// allocate memory for count arrays
for (curLayer = 0; curLayer < retroVars.layersToCalculate.size(); curLayer++) {
for (curLayer = 0; curLayer < retroVars.layersToCalculate.size(); curLayer++)
{
numKnotsInCurLayer = layerStats[retroVars.layersToCalculate[curLayer]].knotsInLayer;
retroVars.countArrays[curLayer] = new CountArrayVarType[numKnotsInCurLayer];
memoryUsed2 += numKnotsInCurLayer * sizeof(CountArrayVarType);
@ -294,37 +336,49 @@ bool MiniMax::prepareCountArrays(retroAnalysisGlobalVars &retroVars)
}
// load file if already existend
if (GetFileSizeEx(hFileCountArray, &fileSize) && fileSize.QuadPart == retroVars.numKnotsToCalc) {
if (GetFileSizeEx(hFileCountArray, &fileSize) && fileSize.QuadPart == retroVars.numKnotsToCalc)
{
PRINT(2, this, " Load number of succedors from file: " << ssCountArrayFilePath.str().c_str());
for (curLayer = 0; curLayer < retroVars.layersToCalculate.size(); curLayer++) {
for (curLayer = 0; curLayer < retroVars.layersToCalculate.size(); curLayer++)
{
numKnotsInCurLayer = layerStats[retroVars.layersToCalculate[curLayer]].knotsInLayer;
if (!ReadFile(hFileCountArray, retroVars.countArrays[curLayer], numKnotsInCurLayer * sizeof(CountArrayVarType), &dwRead, nullptr)) return falseOrStop();
if (dwRead != numKnotsInCurLayer * sizeof(CountArrayVarType)) return falseOrStop();
if (!ReadFile(hFileCountArray, retroVars.countArrays[curLayer], numKnotsInCurLayer * sizeof(CountArrayVarType), &dwRead, nullptr))
return falseOrStop();
if (dwRead != numKnotsInCurLayer * sizeof(CountArrayVarType))
return falseOrStop();
}
// else calculate number of succedding states
} else {
}
else
{
// Set default value 0
for (curLayer = 0; curLayer < retroVars.layersToCalculate.size(); curLayer++) {
for (curLayer = 0; curLayer < retroVars.layersToCalculate.size(); curLayer++)
{
numKnotsInCurLayer = layerStats[retroVars.layersToCalculate[curLayer]].knotsInLayer;
for (curState.stateNumber = 0; curState.stateNumber < numKnotsInCurLayer; curState.stateNumber++) {
for (curState.stateNumber = 0; curState.stateNumber < numKnotsInCurLayer; curState.stateNumber++)
{
retroVars.countArrays[curLayer][curState.stateNumber] = defValue;
}
}
// calc values
if (!calcNumSuccedors(retroVars)) {
if (!calcNumSuccedors(retroVars))
{
CloseHandle(hFileCountArray);
return false;
}
// save to file
for (curLayer = 0, dwWritten = 0; curLayer < retroVars.layersToCalculate.size(); curLayer++) {
for (curLayer = 0, dwWritten = 0; curLayer < retroVars.layersToCalculate.size(); curLayer++)
{
numKnotsInCurLayer = layerStats[retroVars.layersToCalculate[curLayer]].knotsInLayer;
if (!WriteFile(hFileCountArray, retroVars.countArrays[curLayer], numKnotsInCurLayer * sizeof(CountArrayVarType), &dwWritten, nullptr)) return falseOrStop();
if (dwWritten != numKnotsInCurLayer * sizeof(CountArrayVarType)) return falseOrStop();
if (!WriteFile(hFileCountArray, retroVars.countArrays[curLayer], numKnotsInCurLayer * sizeof(CountArrayVarType), &dwWritten, nullptr))
return falseOrStop();
if (dwWritten != numKnotsInCurLayer * sizeof(CountArrayVarType))
return falseOrStop();
}
PRINT(2, this, " Count array saved to file: " << ssCountArrayFilePath.str());
}
@ -348,14 +402,16 @@ bool MiniMax::calcNumSuccedors(retroAnalysisGlobalVars &retroVars)
vector<bool> succCalculated(skvfHeader.numLayers, false); //
// process each layer
for (curLayerId = 0; curLayerId < retroVars.layersToCalculate.size(); curLayerId++) {
for (curLayerId = 0; curLayerId < retroVars.layersToCalculate.size(); curLayerId++)
{
// set current processed layer number
layerNumber = retroVars.layersToCalculate[curLayerId];
PRINT(0, this, " *** Calculate number of succeding states for each state of layer " << layerNumber << " ***");
// process layer ...
if (!succCalculated[layerNumber]) {
if (!succCalculated[layerNumber])
{
// prepare parameters for multithreading
succCalculated[layerNumber] = true;
@ -363,7 +419,8 @@ bool MiniMax::calcNumSuccedors(retroAnalysisGlobalVars &retroVars)
ThreadManager::ThreadVarsArray<AddNumSuccedorsVars> tva(threadManager.getNumThreads(), AddNumSuccedorsVars(this, &retroVars, layerNumber));
// process each state in the current layer
switch (threadManager.executeParallelLoop(addNumSuccedorsThreadProc, tva.getPointerToArray(), tva.getSizeOfArray(), TM_SCHEDULE_STATIC, 0, layerStats[layerNumber].knotsInLayer - 1, 1)) {
switch (threadManager.executeParallelLoop(addNumSuccedorsThreadProc, tva.getPointerToArray(), tva.getSizeOfArray(), TM_SCHEDULE_STATIC, 0, layerStats[layerNumber].knotsInLayer - 1, 1))
{
case TM_RETURN_VALUE_OK:
break;
case TM_RETURN_VALUE_EXECUTION_CANCELLED:
@ -377,25 +434,32 @@ bool MiniMax::calcNumSuccedors(retroAnalysisGlobalVars &retroVars)
// reduce and delete thread specific data
tva.reduce();
if (numStatesProcessed < layerStats[layerNumber].knotsInLayer) return falseOrStop();
if (numStatesProcessed < layerStats[layerNumber].knotsInLayer)
return falseOrStop();
// don't calc layers twice
} else {
}
else
{
return falseOrStop();
}
// ... and process succeding layers
for (curState.layerNumber = 0; curState.layerNumber < layerStats[layerNumber].numSuccLayers; curState.layerNumber++) {
for (curState.layerNumber = 0; curState.layerNumber < layerStats[layerNumber].numSuccLayers; curState.layerNumber++)
{
// get current pred. layer
succState.layerNumber = layerStats[layerNumber].succLayers[curState.layerNumber];
// don't add layers twice
if (succCalculated[succState.layerNumber]) continue;
else succCalculated[succState.layerNumber] = true;
if (succCalculated[succState.layerNumber])
continue;
else
succCalculated[succState.layerNumber] = true;
// don't process layers without states
if (!layerStats[succState.layerNumber].knotsInLayer) continue;
if (!layerStats[succState.layerNumber].knotsInLayer)
continue;
// check all states of pred. layer
PRINT(2, this, " - Do the same for the succeding layer " << (int)succState.layerNumber);
@ -405,7 +469,8 @@ bool MiniMax::calcNumSuccedors(retroAnalysisGlobalVars &retroVars)
ThreadManager::ThreadVarsArray<AddNumSuccedorsVars> tva(threadManager.getNumThreads(), AddNumSuccedorsVars(this, &retroVars, succState.layerNumber));
// process each state in the current layer
switch (threadManager.executeParallelLoop(addNumSuccedorsThreadProc, tva.getPointerToArray(), tva.getSizeOfArray(), TM_SCHEDULE_STATIC, 0, layerStats[succState.layerNumber].knotsInLayer - 1, 1)) {
switch (threadManager.executeParallelLoop(addNumSuccedorsThreadProc, tva.getPointerToArray(), tva.getSizeOfArray(), TM_SCHEDULE_STATIC, 0, layerStats[succState.layerNumber].knotsInLayer - 1, 1))
{
case TM_RETURN_VALUE_OK:
break;
case TM_RETURN_VALUE_EXECUTION_CANCELLED:
@ -419,7 +484,8 @@ bool MiniMax::calcNumSuccedors(retroAnalysisGlobalVars &retroVars)
// reduce and delete thread specific data
tva.reduce();
if (numStatesProcessed < layerStats[succState.layerNumber].knotsInLayer) return falseOrStop();
if (numStatesProcessed < layerStats[succState.layerNumber].knotsInLayer)
return falseOrStop();
}
}
@ -452,17 +518,20 @@ DWORD MiniMax::addNumSuccedorsThreadProc(void *pParameter, int index)
// print status
ansVars->statesProcessed++;
if (ansVars->statesProcessed % OUTPUT_EVERY_N_STATES == 0) {
if (ansVars->statesProcessed % OUTPUT_EVERY_N_STATES == 0)
{
m->numStatesProcessed += OUTPUT_EVERY_N_STATES;
PRINT(2, m, " Already processed " << m->numStatesProcessed << " of " << m->layerStats[curState.layerNumber].knotsInLayer << " states");
}
// invalid state ?
m->readKnotValueFromDatabase(curState.layerNumber, curState.stateNumber, curStateValue);
if (curStateValue == SKV_VALUE_INVALID) return TM_RETURN_VALUE_OK;
if (curStateValue == SKV_VALUE_INVALID)
return TM_RETURN_VALUE_OK;
// set current selected situation
if (!m->setSituation(ansVars->curThreadNo, curState.layerNumber, curState.stateNumber)) {
if (!m->setSituation(ansVars->curThreadNo, curState.layerNumber, curState.stateNumber))
{
PRINT(0, m, "ERROR: setSituation() returned false!");
return TM_RETURN_VALUE_TERMINATE_ALL_THREADS;
}
@ -471,20 +540,25 @@ DWORD MiniMax::addNumSuccedorsThreadProc(void *pParameter, int index)
m->getPredecessors(ansVars->curThreadNo, &amountOfPred, ansVars->predVars);
// iteration
for (curPred = 0; curPred < amountOfPred; curPred++) {
for (curPred = 0; curPred < amountOfPred; curPred++)
{
// current predecessor
predState.layerNumber = ansVars->predVars[curPred].predLayerNumbers;
predState.stateNumber = ansVars->predVars[curPred].predStateNumbers;
// don't calculate states from layers above yet
for (curLayerId = 0; curLayerId < numLayersToCalculate; curLayerId++) {
if (ansVars->retroVars->layersToCalculate[curLayerId] == predState.layerNumber) break;
for (curLayerId = 0; curLayerId < numLayersToCalculate; curLayerId++)
{
if (ansVars->retroVars->layersToCalculate[curLayerId] == predState.layerNumber)
break;
}
if (curLayerId == numLayersToCalculate) continue;
if (curLayerId == numLayersToCalculate)
continue;
// put in list (with states to be processed) if state is final
if (!cuStateAddedToProcessQueue && (curStateValue == SKV_VALUE_GAME_WON || curStateValue == SKV_VALUE_GAME_LOST)) {
if (!cuStateAddedToProcessQueue && (curStateValue == SKV_VALUE_GAME_WON || curStateValue == SKV_VALUE_GAME_LOST))
{
m->readPlyInfoFromDatabase(curState.layerNumber, curState.stateNumber, numPlies);
m->addStateToProcessQueue(*ansVars->retroVars, ansVars->retroVars->thread[ansVars->curThreadNo], numPlies, &curState);
cuStateAddedToProcessQueue = true;
@ -496,13 +570,17 @@ DWORD MiniMax::addNumSuccedorsThreadProc(void *pParameter, int index)
long mask = 0x000000ff << numBitsToShift;
long curCountLong, newCountLong;
do {
do
{
curCountLong = *pCountValue;
countValue = (CountArrayVarType)((curCountLong & mask) >> numBitsToShift);
if (countValue == 255) {
if (countValue == 255)
{
PRINT(0, m, "ERROR: maximum value for Count[] reached!");
return TM_RETURN_VALUE_TERMINATE_ALL_THREADS;
} else {
}
else
{
countValue++;
newCountLong = (curCountLong & (~mask)) + (countValue << numBitsToShift);
}
@ -529,7 +607,8 @@ bool MiniMax::performRetroAnalysis(retroAnalysisGlobalVars &retroVars)
curCalculationActionId = MM_ACTION_PERFORM_RETRO_ANAL;
// process each state in the current layer
switch (threadManager.executeInParallel(performRetroAnalysisThreadProc, (void **)&retroVars, 0)) {
switch (threadManager.executeInParallel(performRetroAnalysisThreadProc, (void **)&retroVars, 0))
{
case TM_RETURN_VALUE_OK:
break;
case TM_RETURN_VALUE_EXECUTION_CANCELLED:
@ -542,8 +621,10 @@ bool MiniMax::performRetroAnalysis(retroAnalysisGlobalVars &retroVars)
}
// if there are still states to process, than something went wrong
for (unsigned int curThreadNo = 0; curThreadNo < threadManager.getNumThreads(); curThreadNo++) {
if (retroVars.thread[curThreadNo].numStatesToProcess) {
for (unsigned int curThreadNo = 0; curThreadNo < threadManager.getNumThreads(); curThreadNo++)
{
if (retroVars.thread[curThreadNo].numStatesToProcess)
{
PRINT(0, this, "ERROR: There are still states to process after performing retro analysis!");
return falseOrStop();
}
@ -551,11 +632,15 @@ bool MiniMax::performRetroAnalysis(retroAnalysisGlobalVars &retroVars)
// copy drawn and invalid states to ply info
PRINT(2, this, " Copy drawn and invalid states to ply info database...");
for (curLayerId = 0; curLayerId < retroVars.layersToCalculate.size(); curLayerId++) {
for (curState.layerNumber = retroVars.layersToCalculate[curLayerId], curState.stateNumber = 0; curState.stateNumber < layerStats[curState.layerNumber].knotsInLayer; curState.stateNumber++) {
for (curLayerId = 0; curLayerId < retroVars.layersToCalculate.size(); curLayerId++)
{
for (curState.layerNumber = retroVars.layersToCalculate[curLayerId], curState.stateNumber = 0; curState.stateNumber < layerStats[curState.layerNumber].knotsInLayer; curState.stateNumber++)
{
readKnotValueFromDatabase(curState.layerNumber, curState.stateNumber, curStateValue);
if (curStateValue == SKV_VALUE_GAME_DRAWN) savePlyInfoInDatabase(curState.layerNumber, curState.stateNumber, PLYINFO_VALUE_DRAWN);
if (curStateValue == SKV_VALUE_INVALID) savePlyInfoInDatabase(curState.layerNumber, curState.stateNumber, PLYINFO_VALUE_INVALID);
if (curStateValue == SKV_VALUE_GAME_DRAWN)
savePlyInfoInDatabase(curState.layerNumber, curState.stateNumber, PLYINFO_VALUE_DRAWN);
if (curStateValue == SKV_VALUE_INVALID)
savePlyInfoInDatabase(curState.layerNumber, curState.stateNumber, PLYINFO_VALUE_INVALID);
}
}
PRINT(1, this, " *** Iteration finished! ***");
@ -592,22 +677,28 @@ DWORD MiniMax::performRetroAnalysisThreadProc(void *pParameter)
TwoBit curStateValue; // current state value
RetroAnalysisPredVars predVars[MAX_NUM_PREDECESSORS];
for (numStatesProcessed = 0, curNumPlies = 0; curNumPlies < threadVars->statesToProcess.size(); curNumPlies++) {
for (numStatesProcessed = 0, curNumPlies = 0; curNumPlies < threadVars->statesToProcess.size(); curNumPlies++)
{
// skip empty and uninitialized cyclic arrays
if (threadVars->statesToProcess[curNumPlies] != nullptr) {
if (threadVars->statesToProcess[curNumPlies] != nullptr)
{
if (threadNo == 0) {
if (threadNo == 0)
{
PRINT(0, m, " Current number of plies: " << (unsigned int)curNumPlies << "/" << threadVars->statesToProcess.size());
for (threadCounter = 0; threadCounter < m->threadManager.getNumThreads(); threadCounter++) {
for (threadCounter = 0; threadCounter < m->threadManager.getNumThreads(); threadCounter++)
{
PRINT(0, m, " States to process for thread " << threadCounter << ": " << retroVars->thread[threadCounter].numStatesToProcess);
}
}
while (threadVars->statesToProcess[curNumPlies]->takeBytes(sizeof(StateAdress), (unsigned char *)&curState)) {
while (threadVars->statesToProcess[curNumPlies]->takeBytes(sizeof(StateAdress), (unsigned char *)&curState))
{
// execution cancelled by user?
if (m->threadManager.wasExecutionCancelled()) {
if (m->threadManager.wasExecutionCancelled())
{
PRINT(0, m, "\n****************************************\nSub-thread no. " << threadNo << ": Execution cancelled by user!\n****************************************\n");
return TM_RETURN_VALUE_EXECUTION_CANCELLED;
}
@ -616,7 +707,8 @@ DWORD MiniMax::performRetroAnalysisThreadProc(void *pParameter)
m->readKnotValueFromDatabase(curState.layerNumber, curState.stateNumber, curStateValue);
m->readPlyInfoFromDatabase(curState.layerNumber, curState.stateNumber, numPliesTillCurState);
if (numPliesTillCurState != curNumPlies) {
if (numPliesTillCurState != curNumPlies)
{
PRINT(0, m, "ERROR: numPliesTillCurState != curNumPlies");
return TM_RETURN_VALUE_TERMINATE_ALL_THREADS;
}
@ -624,16 +716,19 @@ DWORD MiniMax::performRetroAnalysisThreadProc(void *pParameter)
// console output
numStatesProcessed++;
threadVars->numStatesToProcess--;
if (numStatesProcessed % OUTPUT_EVERY_N_STATES == 0) {
if (numStatesProcessed % OUTPUT_EVERY_N_STATES == 0)
{
m->numStatesProcessed += OUTPUT_EVERY_N_STATES;
for (totalNumStatesToProcess = 0, threadCounter = 0; threadCounter < m->threadManager.getNumThreads(); threadCounter++) {
for (totalNumStatesToProcess = 0, threadCounter = 0; threadCounter < m->threadManager.getNumThreads(); threadCounter++)
{
totalNumStatesToProcess += retroVars->thread[threadCounter].numStatesToProcess;
}
PRINT(2, m, " states already processed: " << m->numStatesProcessed << " \t states still in list: " << totalNumStatesToProcess);
}
// set current selected situation
if (!m->setSituation(threadNo, curState.layerNumber, curState.stateNumber)) {
if (!m->setSituation(threadNo, curState.layerNumber, curState.stateNumber))
{
PRINT(0, m, "ERROR: setSituation() returned false!");
return TM_RETURN_VALUE_TERMINATE_ALL_THREADS;
}
@ -642,48 +737,61 @@ DWORD MiniMax::performRetroAnalysisThreadProc(void *pParameter)
m->getPredecessors(threadNo, &amountOfPred, predVars);
// iteration
for (curPred = 0; curPred < amountOfPred; curPred++) {
for (curPred = 0; curPred < amountOfPred; curPred++)
{
// current predecessor
predState.layerNumber = predVars[curPred].predLayerNumbers;
predState.stateNumber = predVars[curPred].predStateNumbers;
// don't calculate states from layers above yet
for (curLayerId = 0; curLayerId < retroVars->layersToCalculate.size(); curLayerId++) {
if (retroVars->layersToCalculate[curLayerId] == predState.layerNumber) break;
for (curLayerId = 0; curLayerId < retroVars->layersToCalculate.size(); curLayerId++)
{
if (retroVars->layersToCalculate[curLayerId] == predState.layerNumber)
break;
}
if (curLayerId == retroVars->layersToCalculate.size()) continue;
if (curLayerId == retroVars->layersToCalculate.size())
continue;
// get value of predecessor
m->readKnotValueFromDatabase(predState.layerNumber, predState.stateNumber, predStateValue);
// only drawn states are relevant here, since the other are already calculated
if (predStateValue == SKV_VALUE_GAME_DRAWN) {
if (predStateValue == SKV_VALUE_GAME_DRAWN)
{
// if current considered state is a lost game then all predecessors are a won game
if (curStateValue == m->skvPerspectiveMatrix[SKV_VALUE_GAME_LOST][predVars[curPred].playerToMoveChanged ? PL_TO_MOVE_CHANGED : PL_TO_MOVE_UNCHANGED]) {
if (curStateValue == m->skvPerspectiveMatrix[SKV_VALUE_GAME_LOST][predVars[curPred].playerToMoveChanged ? PL_TO_MOVE_CHANGED : PL_TO_MOVE_UNCHANGED])
{
m->saveKnotValueInDatabase(predState.layerNumber, predState.stateNumber, SKV_VALUE_GAME_WON);
m->savePlyInfoInDatabase(predState.layerNumber, predState.stateNumber, numPliesTillCurState + 1); // (requirement: curNumPlies == numPliesTillCurState)
if (numPliesTillCurState + 1 < curNumPlies) {
if (numPliesTillCurState + 1 < curNumPlies)
{
PRINT(0, m, "ERROR: Current number of plies is bigger than numPliesTillCurState + 1!");
return TM_RETURN_VALUE_TERMINATE_ALL_THREADS;
}
m->addStateToProcessQueue(*retroVars, *threadVars, numPliesTillCurState + 1, &predState);
// if current state is a won game, then this state is not an option any more for all predecessors
} else {
}
else
{
// reduce count value by one
long *pCountValue = ((long *)retroVars->countArrays[curLayerId]) + predState.stateNumber / (sizeof(long) / sizeof(CountArrayVarType));
long numBitsToShift = sizeof(CountArrayVarType) * 8 * (predState.stateNumber % (sizeof(long) / sizeof(CountArrayVarType))); // little-endian byte-order
long mask = 0x000000ff << numBitsToShift;
long curCountLong, newCountLong;
do {
do
{
curCountLong = *pCountValue;
countValue = (CountArrayVarType)((curCountLong & mask) >> numBitsToShift);
if (countValue > 0) {
if (countValue > 0)
{
countValue--;
newCountLong = (curCountLong & (~mask)) + (countValue << numBitsToShift);
} else {
}
else
{
PRINT(0, m, "ERROR: Count is already zero!");
return TM_RETURN_VALUE_TERMINATE_ALL_THREADS;
}
@ -691,14 +799,17 @@ DWORD MiniMax::performRetroAnalysisThreadProc(void *pParameter)
// ply info (requirement: curNumPlies == numPliesTillCurState)
m->readPlyInfoFromDatabase(predState.layerNumber, predState.stateNumber, numPliesTillPredState);
if (numPliesTillPredState == PLYINFO_VALUE_UNCALCULATED || numPliesTillCurState + 1 > numPliesTillPredState) {
if (numPliesTillPredState == PLYINFO_VALUE_UNCALCULATED || numPliesTillCurState + 1 > numPliesTillPredState)
{
m->savePlyInfoInDatabase(predState.layerNumber, predState.stateNumber, numPliesTillCurState + 1);
}
// when all successor are won states then this is a lost state (this should only be the case for one thread)
if (countValue == 0) {
if (countValue == 0)
{
m->saveKnotValueInDatabase(predState.layerNumber, predState.stateNumber, SKV_VALUE_GAME_LOST);
if (numPliesTillCurState + 1 < curNumPlies) {
if (numPliesTillCurState + 1 < curNumPlies)
{
PRINT(0, m, "ERROR: Current number of plies is bigger than numPliesTillCurState + 1!");
return TM_RETURN_VALUE_TERMINATE_ALL_THREADS;
}
@ -725,13 +836,15 @@ DWORD MiniMax::performRetroAnalysisThreadProc(void *pParameter)
bool MiniMax::addStateToProcessQueue(retroAnalysisGlobalVars &retroVars, RetroAnalysisThreadVars &threadVars, unsigned int plyNumber, StateAdress *pState)
{
// resize vector if too small
if (plyNumber >= threadVars.statesToProcess.size()) {
if (plyNumber >= threadVars.statesToProcess.size())
{
threadVars.statesToProcess.resize(max(plyNumber + 1, 10 * threadVars.statesToProcess.size()), nullptr);
PRINT(4, this, " statesToProcess resized to " << threadVars.statesToProcess.size());
}
// initialize cyclic array if necessary
if (threadVars.statesToProcess[plyNumber] == nullptr) {
if (threadVars.statesToProcess[plyNumber] == nullptr)
{
stringstream ssStatesToProcessFilePath;
stringstream ssStatesToProcessPath;
ssStatesToProcessPath << fileDirectory << (fileDirectory.size() ? "\\" : "") << "statesToProcess";
@ -743,7 +856,8 @@ bool MiniMax::addStateToProcessQueue(retroAnalysisGlobalVars &retroVars, RetroAn
}
// add state
if (!threadVars.statesToProcess[plyNumber]->addBytes(sizeof(StateAdress), (unsigned char *)pState)) {
if (!threadVars.statesToProcess[plyNumber]->addBytes(sizeof(StateAdress), (unsigned char *)pState))
{
PRINT(0, this, "ERROR: Cyclic list to small! numStatesToProcess:" << threadVars.numStatesToProcess);
return falseOrStop();
}

266
src/perfect/miniMax_test.cpp
View File

@ -19,7 +19,8 @@ bool MiniMax::testLayer(unsigned int layerNumber)
unsigned int returnValue;
// database open?
if (hFileShortKnotValues == nullptr || hFilePlyInfo == nullptr) {
if (hFileShortKnotValues == nullptr || hFilePlyInfo == nullptr)
{
PRINT(0, this, "ERROR: Database file not open!");
return falseOrStop();
}
@ -35,7 +36,8 @@ bool MiniMax::testLayer(unsigned int layerNumber)
curCalculatedLayer = layerNumber;
curCalculationActionId = MM_ACTION_TESTING_LAYER;
TestLayersVars *tlVars = new TestLayersVars[threadManager.getNumThreads()];
for (curThreadNo = 0; curThreadNo < threadManager.getNumThreads(); curThreadNo++) {
for (curThreadNo = 0; curThreadNo < threadManager.getNumThreads(); curThreadNo++)
{
tlVars[curThreadNo].curThreadNo = curThreadNo;
tlVars[curThreadNo].pMiniMax = this;
tlVars[curThreadNo].layerNumber = layerNumber;
@ -47,21 +49,26 @@ bool MiniMax::testLayer(unsigned int layerNumber)
// process each state in the current layer
returnValue = threadManager.executeParallelLoop(testLayerThreadProc, (void *)tlVars, sizeof(TestLayersVars), TM_SCHEDULE_STATIC, 0, layerStats[layerNumber].knotsInLayer - 1, 1);
switch (returnValue) {
switch (returnValue)
{
case TM_RETURN_VALUE_OK:
case TM_RETURN_VALUE_EXECUTION_CANCELLED:
// reduce and delete thread specific data
for (numStatesProcessed = 0, curThreadNo = 0; curThreadNo < threadManager.getNumThreads(); curThreadNo++) {
for (numStatesProcessed = 0, curThreadNo = 0; curThreadNo < threadManager.getNumThreads(); curThreadNo++)
{
numStatesProcessed += tlVars[curThreadNo].statesProcessed;
SAFE_DELETE_ARRAY(tlVars[curThreadNo].subValueInDatabase);
SAFE_DELETE_ARRAY(tlVars[curThreadNo].hasCurPlayerChanged);
SAFE_DELETE_ARRAY(tlVars[curThreadNo].subPlyInfos);
}
SAFE_DELETE_ARRAY(tlVars);
if (returnValue == TM_RETURN_VALUE_EXECUTION_CANCELLED) {
if (returnValue == TM_RETURN_VALUE_EXECUTION_CANCELLED)
{
PRINT(0, this, "Main thread: Execution cancelled by user");
return false; // ... better would be to return a cancel-specific value
} else {
}
else
{
break;
}
default:
@ -71,12 +78,16 @@ bool MiniMax::testLayer(unsigned int layerNumber)
}
// layer is not ok
if (numStatesProcessed < layerStats[layerNumber].knotsInLayer) {
if (numStatesProcessed < layerStats[layerNumber].knotsInLayer)
{
PRINT(0, this, "DATABASE ERROR IN LAYER " << layerNumber);
return falseOrStop();
// layer is ok
} else {
PRINT(1, this, " TEST PASSED !" << endl << endl);
}
else
{
PRINT(1, this, " TEST PASSED !" << endl
<< endl);
return true;
}
}
@ -113,7 +124,8 @@ DWORD MiniMax::testLayerThreadProc(void *pParameter, int index)
// output
tlVars->statesProcessed++;
if (tlVars->statesProcessed % OUTPUT_EVERY_N_STATES == 0) {
if (tlVars->statesProcessed % OUTPUT_EVERY_N_STATES == 0)
{
m->numStatesProcessed += OUTPUT_EVERY_N_STATES;
PRINT(0, m, m->numStatesProcessed << " states of " << m->layerStats[layerNumber].knotsInLayer << " tested");
}
@ -123,19 +135,24 @@ DWORD MiniMax::testLayerThreadProc(void *pParameter, int index)
m->readPlyInfoFromDatabase(layerNumber, stateNumber, numPliesTillCurState);
// prepare the situation
if (!m->setSituation(threadNo, layerNumber, stateNumber)) {
if (!m->setSituation(threadNo, layerNumber, stateNumber))
{
// when situation cannot be constructed then state must be marked as invalid in database
if (shortValueInDatabase != SKV_VALUE_INVALID || numPliesTillCurState != PLYINFO_VALUE_INVALID) {
if (shortValueInDatabase != SKV_VALUE_INVALID || numPliesTillCurState != PLYINFO_VALUE_INVALID)
{
PRINT(0, m, "ERROR: DATABASE ERROR IN LAYER " << layerNumber << " AND STATE " << stateNumber << ": Could not set situation, but value is not invalid.");
goto errorInDatabase;
} else {
}
else
{
return TM_RETURN_VALUE_OK;
}
}
// debug information
if (m->verbosity > 5) {
if (m->verbosity > 5)
{
PRINT(5, m, "layer: " << layerNumber << " state: " << stateNumber);
m->printBoard(threadNo, shortValueInDatabase);
}
@ -145,23 +162,30 @@ DWORD MiniMax::testLayerThreadProc(void *pParameter, int index)
idPossibility = m->getPossibilities(threadNo, &numPossibilities, &isOpponentLevel, &pPossibilities);
// unable to move
if (numPossibilities == 0) {
if (numPossibilities == 0)
{
// get ingame value
m->getValueOfSituation(threadNo, floatValueInGame, shortValueInGame);
// compare database with game
if (shortValueInDatabase != shortValueInGame || numPliesTillCurState != 0) {
PRINT(0, m, "ERROR: DATABASE ERROR IN LAYER " << layerNumber << " AND STATE " << stateNumber << ": Number of possibilities is zero, but knot value is not invalid or ply info equal zero."); goto errorInDatabase;
if (shortValueInDatabase != shortValueInGame || numPliesTillCurState != 0)
{
PRINT(0, m, "ERROR: DATABASE ERROR IN LAYER " << layerNumber << " AND STATE " << stateNumber << ": Number of possibilities is zero, but knot value is not invalid or ply info equal zero.");
goto errorInDatabase;
}
if (shortValueInDatabase == SKV_VALUE_INVALID) {
PRINT(0, m, "ERROR: DATABASE ERROR IN LAYER " << layerNumber << " AND STATE " << stateNumber << ": Number of possibilities is zero, but knot value is invalid."); goto errorInDatabase;
if (shortValueInDatabase == SKV_VALUE_INVALID)
{
PRINT(0, m, "ERROR: DATABASE ERROR IN LAYER " << layerNumber << " AND STATE " << stateNumber << ": Number of possibilities is zero, but knot value is invalid.");
goto errorInDatabase;
}
} else {
}
else
{
// check each possible move
for (i = 0; i < numPossibilities; i++) {
for (i = 0; i < numPossibilities; i++)
{
// move
m->move(threadNo, idPossibility[i], isOpponentLevel, &pBackup, pPossibilities);
@ -172,14 +196,17 @@ DWORD MiniMax::testLayerThreadProc(void *pParameter, int index)
hasCurPlayerChanged[i] = (m->getOpponentLevel(threadNo) == true);
// debug information
if (m->verbosity > 5) {
if (m->verbosity > 5)
{
PRINT(5, m, "layer: " << tmpLayerNumber << " state: " << tmpStateNumber << " value: " << (int)subValueInDatabase[i]);
m->printBoard(threadNo, subValueInDatabase[i]);
}
// if layer or state number is invalid then value of testes state must be invalid
if (invalidLayerOrStateNumber && shortValueInDatabase != SKV_VALUE_INVALID) {
PRINT(0, m, "ERROR: DATABASE ERROR IN LAYER " << layerNumber << " AND STATE " << stateNumber << ": Succeding state has invalid layer (" << tmpLayerNumber << ")or state number (" << tmpStateNumber << "), but tested state is not marked as invalid."); goto errorInDatabase;
if (invalidLayerOrStateNumber && shortValueInDatabase != SKV_VALUE_INVALID)
{
PRINT(0, m, "ERROR: DATABASE ERROR IN LAYER " << layerNumber << " AND STATE " << stateNumber << ": Succeding state has invalid layer (" << tmpLayerNumber << ")or state number (" << tmpStateNumber << "), but tested state is not marked as invalid.");
goto errorInDatabase;
}
// BUG: Does not work because, layer 101 is calculated before 105, although removing a stone does need this jump.
// if (!layerInDatabaseAndCompleted) { PRINT(0,m, "ERROR: DATABASE ERROR IN LAYER " << layerNumber << " AND STATE " << stateNumber << ": Succeding state " << tmpStateNumber << " in an uncalculated layer " << tmpLayerNumber << "! Calc layer first!"); goto errorInDatabase; }
@ -189,39 +216,50 @@ DWORD MiniMax::testLayerThreadProc(void *pParameter, int index)
}
// value possible?
switch (shortValueInDatabase) {
switch (shortValueInDatabase)
{
case SKV_VALUE_GAME_LOST:
// all possible moves must be lost for the current player or won for the opponent
for (i = 0; i < numPossibilities; i++) {
if (subValueInDatabase[i] != ((hasCurPlayerChanged[i]) ? SKV_VALUE_GAME_WON : SKV_VALUE_GAME_LOST) && subValueInDatabase[i] != SKV_VALUE_INVALID) {
for (i = 0; i < numPossibilities; i++)
{
if (subValueInDatabase[i] != ((hasCurPlayerChanged[i]) ? SKV_VALUE_GAME_WON : SKV_VALUE_GAME_LOST) && subValueInDatabase[i] != SKV_VALUE_INVALID)
{
PRINT(0, m, "ERROR: DATABASE ERROR IN LAYER " << layerNumber << " AND STATE " << stateNumber << ": All possible moves must be lost for the current player or won for the opponent");
goto errorInDatabase;
}
}
// not all options can be invalid
for (j = 0, i = 0; i < numPossibilities; i++) {
if (subValueInDatabase[i] == SKV_VALUE_INVALID) {
for (j = 0, i = 0; i < numPossibilities; i++)
{
if (subValueInDatabase[i] == SKV_VALUE_INVALID)
{
j++;
}
}
if (j == numPossibilities) {
if (j == numPossibilities)
{
PRINT(0, m, "DATABASE ERROR IN LAYER " << layerNumber << " AND STATE " << stateNumber << ". Not all options can be invalid");
}
// ply info must be max(subPlyInfos[]+1)
max = 0;
for (i = 0; i < numPossibilities; i++) {
if (subValueInDatabase[i] == ((hasCurPlayerChanged[i]) ? SKV_VALUE_GAME_WON : SKV_VALUE_GAME_LOST)) {
if (subPlyInfos[i] + 1 > max) {
for (i = 0; i < numPossibilities; i++)
{
if (subValueInDatabase[i] == ((hasCurPlayerChanged[i]) ? SKV_VALUE_GAME_WON : SKV_VALUE_GAME_LOST))
{
if (subPlyInfos[i] + 1 > max)
{
max = subPlyInfos[i] + 1;
}
}
}
if (numPliesTillCurState > PLYINFO_VALUE_DRAWN) {
if (numPliesTillCurState > PLYINFO_VALUE_DRAWN)
{
PRINT(0, m, "DATABASE ERROR IN LAYER " << layerNumber << " AND STATE " << stateNumber << ": Knot value is LOST, but numPliesTillCurState is bigger than PLYINFO_MAX_VALUE.");
goto errorInDatabase;
}
if (numPliesTillCurState != max) {
if (numPliesTillCurState != max)
{
PRINT(0, m, "DATABASE ERROR IN LAYER " << layerNumber << " AND STATE " << stateNumber << ": Number of needed plies is not maximal for LOST state.");
goto errorInDatabase;
}
@ -230,29 +268,37 @@ DWORD MiniMax::testLayerThreadProc(void *pParameter, int index)
case SKV_VALUE_GAME_WON:
// at least one possible move must be lost for the opponent or won for the current player
for (i = 0; i < numPossibilities; i++) {
for (i = 0; i < numPossibilities; i++)
{
// if (subValueInDatabase[i] == SKV_VALUE_INVALID) { PRINT(0,m, "DATABASE ERROR IN LAYER " << layerNumber << " AND STATE " << stateNumber << ": At least one possible move must be lost for the opponent or won for the current player. But subValueInDatabase[i] == SKV_VALUE_INVALID."); goto errorInDatabase; }
if (subValueInDatabase[i] == ((hasCurPlayerChanged[i]) ? SKV_VALUE_GAME_LOST : SKV_VALUE_GAME_WON)) i = numPossibilities;
if (subValueInDatabase[i] == ((hasCurPlayerChanged[i]) ? SKV_VALUE_GAME_LOST : SKV_VALUE_GAME_WON))
i = numPossibilities;
}
if (i == numPossibilities) {
if (i == numPossibilities)
{
PRINT(0, m, "DATABASE ERROR IN LAYER " << layerNumber << " AND STATE " << stateNumber << ": At least one possible move must be lost for the opponent or won for the current player.");
goto errorInDatabase;
}
// ply info must be min(subPlyInfos[]+1)
min = PLYINFO_VALUE_DRAWN;
for (i = 0; i < numPossibilities; i++) {
if (subValueInDatabase[i] == ((hasCurPlayerChanged[i]) ? SKV_VALUE_GAME_LOST : SKV_VALUE_GAME_WON)) {
if (subPlyInfos[i] + 1 < min) {
for (i = 0; i < numPossibilities; i++)
{
if (subValueInDatabase[i] == ((hasCurPlayerChanged[i]) ? SKV_VALUE_GAME_LOST : SKV_VALUE_GAME_WON))
{
if (subPlyInfos[i] + 1 < min)
{
min = subPlyInfos[i] + 1;
}
}
}
if (numPliesTillCurState > PLYINFO_VALUE_DRAWN) {
if (numPliesTillCurState > PLYINFO_VALUE_DRAWN)
{
PRINT(0, m, "DATABASE ERROR IN LAYER " << layerNumber << " AND STATE " << stateNumber << ": Knot value is WON, but numPliesTillCurState is bigger than PLYINFO_MAX_VALUE.");
goto errorInDatabase;
}
if (numPliesTillCurState != min) {
if (numPliesTillCurState != min)
{
PRINT(0, m, "DATABASE ERROR IN LAYER " << layerNumber << " AND STATE " << stateNumber << ": Number of needed plies is not minimal for WON state.");
goto errorInDatabase;
}
@ -261,38 +307,50 @@ DWORD MiniMax::testLayerThreadProc(void *pParameter, int index)
case SKV_VALUE_GAME_DRAWN:
// all possible moves must be won for the opponent, lost for the current player or drawn
for (j = 0, i = 0; i < numPossibilities; i++) {
for (j = 0, i = 0; i < numPossibilities; i++)
{
// if (subValueInDatabase[i] == SKV_VALUE_INVALID) { PRINT(0,m, "DATABASE ERROR IN LAYER " << layerNumber << " AND STATE " << stateNumber << ": All possible moves must be won for the opponent, lost for the current player or drawn. But subValueInDatabase[i] == SKV_VALUE_INVALID."); goto errorInDatabase; }
if (subValueInDatabase[i] != ((hasCurPlayerChanged[i]) ? SKV_VALUE_GAME_WON : SKV_VALUE_GAME_LOST)
&& subValueInDatabase[i] != SKV_VALUE_GAME_DRAWN
&& subValueInDatabase[i] != SKV_VALUE_INVALID) {
PRINT(0, m, "DATABASE ERROR IN LAYER " << layerNumber << " AND STATE " << stateNumber << ": All possible moves must be won for the opponent, lost for the current player or drawn."); goto errorInDatabase;
if (subValueInDatabase[i] != ((hasCurPlayerChanged[i]) ? SKV_VALUE_GAME_WON : SKV_VALUE_GAME_LOST) && subValueInDatabase[i] != SKV_VALUE_GAME_DRAWN && subValueInDatabase[i] != SKV_VALUE_INVALID)
{
PRINT(0, m, "DATABASE ERROR IN LAYER " << layerNumber << " AND STATE " << stateNumber << ": All possible moves must be won for the opponent, lost for the current player or drawn.");
goto errorInDatabase;
}
if (subValueInDatabase[i] == SKV_VALUE_GAME_DRAWN) j = 1;
if (subValueInDatabase[i] == SKV_VALUE_GAME_DRAWN)
j = 1;
}
// at least one succeding state must be drawn
if (j == 0) {
PRINT(0, m, "DATABASE ERROR IN LAYER " << layerNumber << " AND STATE " << stateNumber << ": At least one succeding state must be drawn."); goto errorInDatabase;
if (j == 0)
{
PRINT(0, m, "DATABASE ERROR IN LAYER " << layerNumber << " AND STATE " << stateNumber << ": At least one succeding state must be drawn.");
goto errorInDatabase;
}
// ply info must also be drawn
if (numPliesTillCurState != PLYINFO_VALUE_DRAWN) {
PRINT(0, m, "DATABASE ERROR IN LAYER " << layerNumber << " AND STATE " << stateNumber << ": Knot value is drawn but ply info is not!"); goto errorInDatabase;
if (numPliesTillCurState != PLYINFO_VALUE_DRAWN)
{
PRINT(0, m, "DATABASE ERROR IN LAYER " << layerNumber << " AND STATE " << stateNumber << ": Knot value is drawn but ply info is not!");
goto errorInDatabase;
}
break;
case SKV_VALUE_INVALID:
// if setSituation() returned true but state value is invalid, then all following states must be invalid
for (i = 0; i < numPossibilities; i++) {
if (subValueInDatabase[i] != SKV_VALUE_INVALID) break;
for (i = 0; i < numPossibilities; i++)
{
if (subValueInDatabase[i] != SKV_VALUE_INVALID)
break;
}
if (i != numPossibilities) {
PRINT(0, m, "DATABASE ERROR IN LAYER " << layerNumber << " AND STATE " << stateNumber << ": If setSituation() returned true but state value is invalid, then all following states must be invalid."); goto errorInDatabase;
if (i != numPossibilities)
{
PRINT(0, m, "DATABASE ERROR IN LAYER " << layerNumber << " AND STATE " << stateNumber << ": If setSituation() returned true but state value is invalid, then all following states must be invalid.");
goto errorInDatabase;
}
// ply info must also be invalid
if (numPliesTillCurState != PLYINFO_VALUE_INVALID) {
PRINT(0, m, "DATABASE ERROR IN LAYER " << layerNumber << " AND STATE " << stateNumber << ": Knot value is invalid but ply info is not!"); goto errorInDatabase;
if (numPliesTillCurState != PLYINFO_VALUE_INVALID)
{
PRINT(0, m, "DATABASE ERROR IN LAYER " << layerNumber << " AND STATE " << stateNumber << ": Knot value is invalid but ply info is not!");
goto errorInDatabase;
}
break;
}
@ -323,7 +381,8 @@ bool MiniMax::testState(unsigned int layerNumber, unsigned int stateNumber)
tlVars.subPlyInfos = new PlyInfoVarType[maxNumBranches];
tlVars.hasCurPlayerChanged = new bool[maxNumBranches];
if (testLayerThreadProc(&tlVars, stateNumber) != TM_RETURN_VALUE_OK) result = false;
if (testLayerThreadProc(&tlVars, stateNumber) != TM_RETURN_VALUE_OK)
result = false;
delete[] tlVars.subValueInDatabase;
delete[] tlVars.subPlyInfos;
@ -350,7 +409,8 @@ bool MiniMax::testSetSituationAndGetPoss(unsigned int layerNumber)
numStatesProcessed = 0;
curCalculationActionId = MM_ACTION_TESTING_LAYER;
TestLayersVars *tlVars = new TestLayersVars[threadManager.getNumThreads()];
for (curThreadNo = 0; curThreadNo < threadManager.getNumThreads(); curThreadNo++) {
for (curThreadNo = 0; curThreadNo < threadManager.getNumThreads(); curThreadNo++)
{
tlVars[curThreadNo].curThreadNo = curThreadNo;
tlVars[curThreadNo].pMiniMax = this;
tlVars[curThreadNo].layerNumber = layerNumber;
@ -362,21 +422,26 @@ bool MiniMax::testSetSituationAndGetPoss(unsigned int layerNumber)
// process each state in the current layer
returnValue = threadManager.executeParallelLoop(testSetSituationThreadProc, (void *)tlVars, sizeof(TestLayersVars), TM_SCHEDULE_STATIC, 0, layerStats[layerNumber].knotsInLayer - 1, 1);
switch (returnValue) {
switch (returnValue)
{
case TM_RETURN_VALUE_OK:
case TM_RETURN_VALUE_EXECUTION_CANCELLED:
// reduce and delete thread specific data
for (numStatesProcessed = 0, curThreadNo = 0; curThreadNo < threadManager.getNumThreads(); curThreadNo++) {
for (numStatesProcessed = 0, curThreadNo = 0; curThreadNo < threadManager.getNumThreads(); curThreadNo++)
{
numStatesProcessed += tlVars[curThreadNo].statesProcessed;
SAFE_DELETE_ARRAY(tlVars[curThreadNo].subValueInDatabase);
SAFE_DELETE_ARRAY(tlVars[curThreadNo].hasCurPlayerChanged);
SAFE_DELETE_ARRAY(tlVars[curThreadNo].subPlyInfos);
}
SAFE_DELETE_ARRAY(tlVars);
if (returnValue == TM_RETURN_VALUE_EXECUTION_CANCELLED) {
if (returnValue == TM_RETURN_VALUE_EXECUTION_CANCELLED)
{
PRINT(0, this, "Main thread: Execution cancelled by user");
return false; // ... better would be to return a cancel-specific value
} else {
}
else
{
break;
}
default:
@ -386,12 +451,16 @@ bool MiniMax::testSetSituationAndGetPoss(unsigned int layerNumber)
}
// layer is not ok
if (numStatesProcessed < layerStats[layerNumber].knotsInLayer) {
if (numStatesProcessed < layerStats[layerNumber].knotsInLayer)
{
PRINT(0, this, "DATABASE ERROR IN LAYER " << layerNumber);
return falseOrStop();
// layer is ok
} else {
PRINT(1, this, " TEST PASSED !" << endl << endl);
}
else
{
PRINT(1, this, " TEST PASSED !" << endl
<< endl);
return true;
}
}
@ -419,15 +488,19 @@ DWORD MiniMax::testSetSituationThreadProc(void *pParameter, int index)
// output
tlVars->statesProcessed++;
if (tlVars->statesProcessed % OUTPUT_EVERY_N_STATES == 0) {
if (tlVars->statesProcessed % OUTPUT_EVERY_N_STATES == 0)
{
m->numStatesProcessed += OUTPUT_EVERY_N_STATES;
PRINT(0, m, m->numStatesProcessed << " states of " << m->layerStats[curState.layerNumber].knotsInLayer << " tested");
}
// set state
if (m->setSituation(tlVars->curThreadNo, curState.layerNumber, curState.stateNumber)) {
if (m->setSituation(tlVars->curThreadNo, curState.layerNumber, curState.stateNumber))
{
m->getValueOfSituation(tlVars->curThreadNo, floatValue, shortKnotValue);
} else {
}
else
{
shortKnotValue = SKV_VALUE_INVALID;
}
@ -435,20 +508,26 @@ DWORD MiniMax::testSetSituationThreadProc(void *pParameter, int index)
idPossibility = m->getPossibilities(tlVars->curThreadNo, &knot.numPossibilities, &knot.isOpponentLevel, &pPossibilities);
// unable to move
if (knot.numPossibilities == 0) {
if (shortKnotValue == SKV_VALUE_GAME_DRAWN) {
if (knot.numPossibilities == 0)
{
if (shortKnotValue == SKV_VALUE_GAME_DRAWN)
{
PRINT(0, m, "ERROR: Layer " << curState.layerNumber << " and state " << curState.stateNumber << ". setSituation() returned true, although getPossibilities() yields no possible moves.");
return m->falseOrStop();
}
// moving is possible
} else {
if (shortKnotValue == SKV_VALUE_INVALID) {
}
else
{
if (shortKnotValue == SKV_VALUE_INVALID)
{
PRINT(0, m, "ERROR: Moved from layer " << curState.layerNumber << " and state " << curState.stateNumber << " setSituation() returned false, although getPossibilities() yields some possible moves.");
return m->falseOrStop();
}
// check each possibility
for (curPoss = 0; curPoss < knot.numPossibilities; curPoss++) {
for (curPoss = 0; curPoss < knot.numPossibilities; curPoss++)
{
// move
m->move(tlVars->curThreadNo, idPossibility[curPoss], knot.isOpponentLevel, &pBackup, pPossibilities);
@ -462,7 +541,8 @@ DWORD MiniMax::testSetSituationThreadProc(void *pParameter, int index)
m->undo(tlVars->curThreadNo, idPossibility[curPoss], knot.isOpponentLevel, pBackup, pPossibilities);
// state reached by move() must not be invalid
if (!m->setSituation(tlVars->curThreadNo, subState.layerNumber, subState.stateNumber)) {
if (!m->setSituation(tlVars->curThreadNo, subState.layerNumber, subState.stateNumber))
{
PRINT(0, m, "ERROR: Moved from layer " << curState.layerNumber << " and state " << curState.stateNumber << " to invalid situation layer " << curState.layerNumber << " and state " << curState.stateNumber);
return m->falseOrStop();
}
@ -495,14 +575,16 @@ bool MiniMax::testIfSymStatesHaveSameValue(unsigned int layerNumber)
unsigned int i;
// database open?
if (hFileShortKnotValues == nullptr || hFilePlyInfo == nullptr) {
if (hFileShortKnotValues == nullptr || hFilePlyInfo == nullptr)
{
PRINT(0, this, "ERROR: Database files not open!");
layerNumber = 0;
goto errorInDatabase;
}
// layer completed ?
if (!layerStats[layerNumber].layerIsCompletedAndInFile) {
if (!layerStats[layerNumber].layerIsCompletedAndInFile)
{
PRINT(0, this, "ERROR: Layer not in file!");
layerNumber = 0;
goto errorInDatabase;
@ -513,33 +595,40 @@ bool MiniMax::testIfSymStatesHaveSameValue(unsigned int layerNumber)
PRINT(1, this, (getOutputInformation(layerNumber)));
skvfHeader.completed = false;
for (layerInDatabase = false, stateNumber = 0; stateNumber < layerStats[layerNumber].knotsInLayer; stateNumber++) {
for (layerInDatabase = false, stateNumber = 0; stateNumber < layerStats[layerNumber].knotsInLayer; stateNumber++)
{
// output
if (stateNumber % OUTPUT_EVERY_N_STATES == 0) PRINT(1, this, stateNumber << " states of " << layerStats[layerNumber].knotsInLayer << " tested");
if (stateNumber % OUTPUT_EVERY_N_STATES == 0)
PRINT(1, this, stateNumber << " states of " << layerStats[layerNumber].knotsInLayer << " tested");
// situation already existend in database ?
readKnotValueFromDatabase(layerNumber, stateNumber, shortValueInDatabase);
readPlyInfoFromDatabase(layerNumber, stateNumber, numPliesTillCurState);
// prepare the situation
if (!setSituation(threadNo, layerNumber, stateNumber)) {
if (!setSituation(threadNo, layerNumber, stateNumber))
{
// when situation cannot be constructed then state must be marked as invalid in database
if (shortValueInDatabase != SKV_VALUE_INVALID || numPliesTillCurState != PLYINFO_VALUE_INVALID) goto errorInDatabase;
else continue;
if (shortValueInDatabase != SKV_VALUE_INVALID || numPliesTillCurState != PLYINFO_VALUE_INVALID)
goto errorInDatabase;
else
continue;
}
// get numbers of symmetric states
getSymStateNumWithDoubles(threadNo, &numSymmetricStates, &symStateNumbers);
// save value for all symmetric states
for (i = 0; i < numSymmetricStates; i++) {
for (i = 0; i < numSymmetricStates; i++)
{
readKnotValueFromDatabase(layerNumber, symStateNumbers[i], shortValueOfSymState);
readPlyInfoFromDatabase(layerNumber, symStateNumbers[i], numPliesTillSymState);
if (shortValueOfSymState != shortValueInDatabase || numPliesTillCurState != numPliesTillSymState) {
if (shortValueOfSymState != shortValueInDatabase || numPliesTillCurState != numPliesTillSymState)
{
PRINT(2, this, "current tested state " << stateNumber << " has value " << (int)shortValueInDatabase);
setSituation(threadNo, layerNumber, stateNumber);
@ -562,6 +651,7 @@ bool MiniMax::testIfSymStatesHaveSameValue(unsigned int layerNumber)
errorInDatabase:
// layer is not ok
if (layerNumber) PRINT(0, this, "DATABASE ERROR IN LAYER " << layerNumber << " AND STATE " << stateNumber);
if (layerNumber)
PRINT(0, this, "DATABASE ERROR IN LAYER " << layerNumber << " AND STATE " << stateNumber);
return falseOrStop();
}

1335
src/perfect/perfectAI.cpp
View File

File diff suppressed because it is too large Load Diff

1
src/perfect/perfectAI.h
View File

@ -78,7 +78,6 @@
class PerfectAI : public MillAI, public MiniMax
{
protected:
// structs
struct SubLayer
{

357
src/perfect/position.cpp
View File

@ -62,9 +62,12 @@ void Position::beginNewGame(MillAI *firstPlayerAI, MillAI *secondPlayerAI, int c
initialField.createBoard();
// calc beginning player
if (currentPlayer == field.playerOne || currentPlayer == field.playerTwo) {
if (currentPlayer == field.playerOne || currentPlayer == field.playerTwo)
{
beginningPlayer = currentPlayer;
} else {
}
else
{
beginningPlayer = (rand() % 2) ? field.playerOne : field.playerTwo;
}
field.curPlayer->id = beginningPlayer;
@ -103,8 +106,10 @@ void Position::setUpCalcPossibleMoves(Player *player)
// locals
unsigned int i, j, k, movingDirection;
for (player->numPossibleMoves = 0, i = 0; i < fieldStruct::size; i++) {
for (j = 0; j < fieldStruct::size; j++) {
for (player->numPossibleMoves = 0, i = 0; i < fieldStruct::size; i++)
{
for (j = 0; j < fieldStruct::size; j++)
{
// is stone from player ?
if (field.board[i] != player->id)
@ -115,7 +120,8 @@ void Position::setUpCalcPossibleMoves(Player *player)
continue;
// when current player has only 3 stones he is allowed to spring his stone
if (player->numStones > 3 || field.settingPhase) {
if (player->numStones > 3 || field.settingPhase)
{
// determine moving direction
for (k = 0, movingDirection = 4; k < 4; k++)
@ -143,7 +149,8 @@ void Position::setUpSetWarningAndMill(unsigned int stone, unsigned int firstNeig
int rowOwner = field.board[stone];
// mill closed ?
if (rowOwner != field.squareIsFree && field.board[firstNeighbour] == rowOwner && field.board[secondNeighbour] == rowOwner) {
if (rowOwner != field.squareIsFree && field.board[firstNeighbour] == rowOwner && field.board[secondNeighbour] == rowOwner)
{
field.stonePartOfMill[stone]++;
field.stonePartOfMill[firstNeighbour]++;
@ -163,9 +170,12 @@ bool Position::put_piece(unsigned int pos, int player)
Player *myPlayer = (player == field.curPlayer->id) ? field.curPlayer : field.oppPlayer;
// check parameters
if (player != fieldStruct::playerOne && player != fieldStruct::playerTwo) return false;
if (pos >= fieldStruct::size) return false;
if (field.board[pos] != field.squareIsFree) return false;
if (player != fieldStruct::playerOne && player != fieldStruct::playerTwo)
return false;
if (pos >= fieldStruct::size)
return false;
if (field.board[pos] != field.squareIsFree)
return false;
// set stone
field.board[pos] = player;
@ -173,50 +183,63 @@ bool Position::put_piece(unsigned int pos, int player)
field.stonesSet++;
// setting phase finished ?
if (field.stonesSet == 18) field.settingPhase = false;
if (field.stonesSet == 18)
field.settingPhase = false;
// calc possible moves
setUpCalcPossibleMoves(field.curPlayer);
setUpCalcPossibleMoves(field.oppPlayer);
// zero
for (i = 0; i < fieldStruct::size; i++) field.stonePartOfMill[i] = 0;
for (i = 0; i < fieldStruct::size; i++)
field.stonePartOfMill[i] = 0;
// go in every direction
for (i = 0; i < fieldStruct::size; i++) {
for (i = 0; i < fieldStruct::size; i++)
{
setUpSetWarningAndMill(i, field.neighbour[i][0][0], field.neighbour[i][0][1]);
setUpSetWarningAndMill(i, field.neighbour[i][1][0], field.neighbour[i][1][1]);
}
// since every mill was detected 3 times
for (i = 0; i < fieldStruct::size; i++) field.stonePartOfMill[i] /= 3;
for (i = 0; i < fieldStruct::size; i++)
field.stonePartOfMill[i] /= 3;
// count completed mills
for (i = 0; i < fieldStruct::size; i++) {
if (field.board[i] == field.curPlayer->id) numberOfMillsCurrentPlayer += field.stonePartOfMill[i];
else numberOfMillsOpponentPlayer += field.stonePartOfMill[i];
for (i = 0; i < fieldStruct::size; i++)
{
if (field.board[i] == field.curPlayer->id)
numberOfMillsCurrentPlayer += field.stonePartOfMill[i];
else
numberOfMillsOpponentPlayer += field.stonePartOfMill[i];
}
numberOfMillsCurrentPlayer /= 3;
numberOfMillsOpponentPlayer /= 3;
// stonesSet & numStonesMissing
if (field.settingPhase) {
if (field.settingPhase)
{
// ... This calculation is not correct! It is possible that some mills did not cause a stone removal.
field.curPlayer->numStonesMissing = numberOfMillsOpponentPlayer;
field.oppPlayer->numStonesMissing = numberOfMillsCurrentPlayer - field.stoneMustBeRemoved;
field.stonesSet = field.curPlayer->numStones + field.oppPlayer->numStones + field.curPlayer->numStonesMissing + field.oppPlayer->numStonesMissing;
} else {
}
else
{
field.stonesSet = 18;
field.curPlayer->numStonesMissing = 9 - field.curPlayer->numStones;
field.oppPlayer->numStonesMissing = 9 - field.oppPlayer->numStones;
}
// when opponent is unable to move than current player has won
if ((!field.curPlayer->numPossibleMoves) && (!field.settingPhase)
&& (!field.stoneMustBeRemoved) && (field.curPlayer->numStones > 3)) winner = field.oppPlayer->id;
else if ((field.curPlayer->numStones < 3) && (!field.settingPhase)) winner = field.oppPlayer->id;
else if ((field.oppPlayer->numStones < 3) && (!field.settingPhase)) winner = field.curPlayer->id;
else winner = 0;
if ((!field.curPlayer->numPossibleMoves) && (!field.settingPhase) && (!field.stoneMustBeRemoved) && (field.curPlayer->numStones > 3))
winner = field.oppPlayer->id;
else if ((field.curPlayer->numStones < 3) && (!field.settingPhase))
winner = field.oppPlayer->id;
else if ((field.oppPlayer->numStones < 3) && (!field.settingPhase))
winner = field.curPlayer->id;
else
winner = 0;
// everything is ok
return true;
@ -243,11 +266,15 @@ bool Position::getField(int *pField)
unsigned int index;
// if no log is available than no game is in progress and board is invalid
if (moveLogFrom == nullptr) return false;
if (moveLogFrom == nullptr)
return false;
for (index = 0; index < field.size; index++) {
if (field.warnings[index] != field.noWarning) pField[index] = (int)field.warnings[index];
else pField[index] = field.board[index];
for (index = 0; index < field.size; index++)
{
if (field.warnings[index] != field.noWarning)
pField[index] = (int)field.warnings[index];
else
pField[index] = field.board[index];
}
return true;
@ -263,7 +290,8 @@ void Position::getLog(unsigned int &numMovesDone, unsigned int *from, unsigned i
numMovesDone = movesDone;
for (index = 0; index < movesDone; index++) {
for (index = 0; index < movesDone; index++)
{
from[index] = moveLogFrom[index];
to[index] = moveLogTo[index];
}
@ -288,8 +316,10 @@ void Position::setNextPlayer()
//-----------------------------------------------------------------------------
bool Position::isCurrentPlayerHuman()
{
if (field.curPlayer->id == field.playerOne) return (playerOneAI == nullptr) ? true : false;
else return (playerTwoAI == nullptr) ? true : false;
if (field.curPlayer->id == field.playerOne)
return (playerOneAI == nullptr) ? true : false;
else
return (playerTwoAI == nullptr) ? true : false;
}
//-----------------------------------------------------------------------------
@ -298,8 +328,10 @@ bool Position::isCurrentPlayerHuman()
//-----------------------------------------------------------------------------
bool Position::isOpponentPlayerHuman()
{
if (field.oppPlayer->id == field.playerOne) return (playerOneAI == nullptr) ? true : false;
else return (playerTwoAI == nullptr) ? true : false;
if (field.oppPlayer->id == field.playerOne)
return (playerOneAI == nullptr) ? true : false;
else
return (playerTwoAI == nullptr) ? true : false;
}
//-----------------------------------------------------------------------------
@ -308,10 +340,12 @@ bool Position::isOpponentPlayerHuman()
//-----------------------------------------------------------------------------
void Position::setAI(int player, MillAI *AI)
{
if (player == field.playerOne) {
if (player == field.playerOne)
{
playerOneAI = AI;
}
if (player == field.playerTwo) {
if (player == field.playerTwo)
{
playerTwoAI = AI;
}
}
@ -327,7 +361,8 @@ void Position::getChoiceOfSpecialAI(MillAI *AI, unsigned int *pushFrom, unsigned
*pushTo = field.size;
theField.createBoard();
field.copyBoard(&theField);
if (AI != nullptr && (field.settingPhase || field.curPlayer->numPossibleMoves > 0) && winner == 0) AI->play(&theField, pushFrom, pushTo);
if (AI != nullptr && (field.settingPhase || field.curPlayer->numPossibleMoves > 0) && winner == 0)
AI->play(&theField, pushFrom, pushTo);
theField.deleteBoard();
}
@ -343,11 +378,17 @@ void Position::getComputersChoice(unsigned int *pushFrom, unsigned int *pushTo)
theField.createBoard();
field.copyBoard(&theField);
if ((field.settingPhase || field.curPlayer->numPossibleMoves > 0) && winner == 0) {
if (field.curPlayer->id == field.playerOne) {
if (playerOneAI != nullptr) playerOneAI->play(&theField, pushFrom, pushTo);
} else {
if (playerTwoAI != nullptr) playerTwoAI->play(&theField, pushFrom, pushTo);
if ((field.settingPhase || field.curPlayer->numPossibleMoves > 0) && winner == 0)
{
if (field.curPlayer->id == field.playerOne)
{
if (playerOneAI != nullptr)
playerOneAI->play(&theField, pushFrom, pushTo);
}
else
{
if (playerTwoAI != nullptr)
playerTwoAI->play(&theField, pushFrom, pushTo);
}
}
@ -364,23 +405,31 @@ bool Position::isNormalMovePossible(unsigned int from, unsigned int to, Player *
unsigned int movingDirection, i;
// parameter ok ?
if (from >= field.size) return false;
if (to >= field.size) return false;
if (from >= field.size)
return false;
if (to >= field.size)
return false;
// is stone from player ?
if (field.board[from] != player->id) return false;
if (field.board[from] != player->id)
return false;
// is destination free ?
if (field.board[to] != field.squareIsFree) return false;
if (field.board[to] != field.squareIsFree)
return false;
// when current player has only 3 stones he is allowed to spring his stone
if (player->numStones > 3 || field.settingPhase) {
if (player->numStones > 3 || field.settingPhase)
{
// determine moving direction
for (i = 0, movingDirection = 4; i < 4; i++) if (field.connectedSquare[from][i] == to) movingDirection = i;
for (i = 0, movingDirection = 4; i < 4; i++)
if (field.connectedSquare[from][i] == to)
movingDirection = i;
// are both squares connected ?
if (movingDirection == 4) return false;
if (movingDirection == 4)
return false;
}
// everything is ok
@ -397,13 +446,18 @@ void Position::calcPossibleMoves(Player *player)
unsigned int i, j;
// zero
for (i = 0; i < MAX_NUM_POS_MOVES; i++) player->posTo[i] = field.size;
for (i = 0; i < MAX_NUM_POS_MOVES; i++) player->posFrom[i] = field.size;
for (i = 0; i < MAX_NUM_POS_MOVES; i++)
player->posTo[i] = field.size;
for (i = 0; i < MAX_NUM_POS_MOVES; i++)
player->posFrom[i] = field.size;
// calc
for (player->numPossibleMoves = 0, i = 0; i < field.size; i++) {
for (j = 0; j < field.size; j++) {
if (isNormalMovePossible(i, j, player)) {
for (player->numPossibleMoves = 0, i = 0; i < field.size; i++)
{
for (j = 0; j < field.size; j++)
{
if (isNormalMovePossible(i, j, player))
{
player->posFrom[player->numPossibleMoves] = i;
player->posTo[player->numPossibleMoves] = j;
player->numPossibleMoves++;
@ -412,10 +466,14 @@ void Position::calcPossibleMoves(Player *player)
}
// stoneMoveAble
for (i = 0; i < field.size; i++) {
for (j = 0; j < 4; j++) {
if (field.board[i] == player->id) field.stoneMoveAble[i][j] = isNormalMovePossible(i, field.connectedSquare[i][j], player);
else field.stoneMoveAble[i][j] = false;
for (i = 0; i < field.size; i++)
{
for (j = 0; j < 4; j++)
{
if (field.board[i] == player->id)
field.stoneMoveAble[i][j] = isNormalMovePossible(i, field.connectedSquare[i][j], player);
else
field.stoneMoveAble[i][j] = false;
}
}
}
@ -431,17 +489,21 @@ void Position::setWarningAndMill(unsigned int stone, unsigned int firstNeighbour
unsigned int rowOwnerWarning = (rowOwner == field.playerOne) ? field.playerOneWarning : field.playerTwoWarning;
// mill closed ?
if (rowOwner != field.squareIsFree && field.board[firstNeighbour] == rowOwner && field.board[secondNeighbour] == rowOwner) {
if (rowOwner != field.squareIsFree && field.board[firstNeighbour] == rowOwner && field.board[secondNeighbour] == rowOwner)
{
field.stonePartOfMill[stone]++;
field.stonePartOfMill[firstNeighbour]++;
field.stonePartOfMill[secondNeighbour]++;
if (isNewStone) field.stoneMustBeRemoved = 1;
if (isNewStone)
field.stoneMustBeRemoved = 1;
}
//warning ?
if (rowOwner != field.squareIsFree && field.board[firstNeighbour] == field.squareIsFree && field.board[secondNeighbour] == rowOwner) field.warnings[firstNeighbour] |= rowOwnerWarning;
if (rowOwner != field.squareIsFree && field.board[secondNeighbour] == field.squareIsFree && field.board[firstNeighbour] == rowOwner) field.warnings[secondNeighbour] |= rowOwnerWarning;
if (rowOwner != field.squareIsFree && field.board[firstNeighbour] == field.squareIsFree && field.board[secondNeighbour] == rowOwner)
field.warnings[firstNeighbour] |= rowOwnerWarning;
if (rowOwner != field.squareIsFree && field.board[secondNeighbour] == field.squareIsFree && field.board[firstNeighbour] == rowOwner)
field.warnings[secondNeighbour] |= rowOwnerWarning;
}
//-----------------------------------------------------------------------------
@ -455,23 +517,30 @@ void Position::updateMillsAndWarnings(unsigned int newStone)
bool atLeastOneStoneRemoveAble;
// zero
for (i = 0; i < field.size; i++) field.stonePartOfMill[i] = 0;
for (i = 0; i < field.size; i++) field.warnings[i] = field.noWarning;
for (i = 0; i < field.size; i++)
field.stonePartOfMill[i] = 0;
for (i = 0; i < field.size; i++)
field.warnings[i] = field.noWarning;
field.stoneMustBeRemoved = 0;
// go in every direction
for (i = 0; i < field.size; i++) {
for (i = 0; i < field.size; i++)
{
setWarningAndMill(i, field.neighbour[i][0][0], field.neighbour[i][0][1], i == newStone);
setWarningAndMill(i, field.neighbour[i][1][0], field.neighbour[i][1][1], i == newStone);
}
// since every mill was detected 3 times
for (i = 0; i < field.size; i++) field.stonePartOfMill[i] /= 3;
for (i = 0; i < field.size; i++)
field.stonePartOfMill[i] /= 3;
// no stone must be removed if each belongs to a mill
for (atLeastOneStoneRemoveAble = false, i = 0; i < field.size; i++) if (field.stonePartOfMill[i] == 0 && field.board[i] == field.oppPlayer->id) atLeastOneStoneRemoveAble = true;
if (!atLeastOneStoneRemoveAble) field.stoneMustBeRemoved = 0;
for (atLeastOneStoneRemoveAble = false, i = 0; i < field.size; i++)
if (field.stonePartOfMill[i] == 0 && field.board[i] == field.oppPlayer->id)
atLeastOneStoneRemoveAble = true;
if (!atLeastOneStoneRemoveAble)
field.stoneMustBeRemoved = 0;
}
//-----------------------------------------------------------------------------
@ -489,7 +558,8 @@ bool Position::do_move(unsigned int pushFrom, unsigned int pushTo)
return false;
// handle the remove of a stone
if (field.stoneMustBeRemoved) {
if (field.stoneMustBeRemoved)
{
// parameter ok ?
if (pushFrom >= field.size)
@ -513,7 +583,8 @@ bool Position::do_move(unsigned int pushFrom, unsigned int pushTo)
movesDone++;
// is the game finished ?
if ((field.oppPlayer->numStones < 3) && (!field.settingPhase)) winner = field.curPlayer->id;
if ((field.oppPlayer->numStones < 3) && (!field.settingPhase))
winner = field.curPlayer->id;
// update warnings & mills
updateMillsAndWarnings(field.size);
@ -523,16 +594,20 @@ bool Position::do_move(unsigned int pushFrom, unsigned int pushTo)
calcPossibleMoves(field.oppPlayer);
// is opponent unable to move ?
if (field.oppPlayer->numPossibleMoves == 0 && !field.settingPhase) winner = field.curPlayer->id;
if (field.oppPlayer->numPossibleMoves == 0 && !field.settingPhase)
winner = field.curPlayer->id;
// next player
if (!field.stoneMustBeRemoved) setNextPlayer();
if (!field.stoneMustBeRemoved)
setNextPlayer();
// everything is ok
return true;
// handle setting phase
} else if (field.settingPhase) {
}
else if (field.settingPhase)
{
// parameter ok ?
if (pushTo >= field.size)
@ -558,19 +633,24 @@ bool Position::do_move(unsigned int pushFrom, unsigned int pushTo)
calcPossibleMoves(field.oppPlayer);
// setting phase finished ?
if (field.stonesSet == 18) field.settingPhase = false;
if (field.stonesSet == 18)
field.settingPhase = false;
// is opponent unable to move ?
if (field.oppPlayer->numPossibleMoves == 0 && !field.settingPhase) winner = field.curPlayer->id;
if (field.oppPlayer->numPossibleMoves == 0 && !field.settingPhase)
winner = field.curPlayer->id;
// next player
if (!field.stoneMustBeRemoved) setNextPlayer();
if (!field.stoneMustBeRemoved)
setNextPlayer();
// everything is ok
return true;
// normal move
} else {
}
else
{
// is move possible ?
if (!isNormalMovePossible(pushFrom, pushTo, field.curPlayer))
@ -591,10 +671,12 @@ bool Position::do_move(unsigned int pushFrom, unsigned int pushTo)
calcPossibleMoves(field.oppPlayer);
// is opponent unable to move ?
if (field.oppPlayer->numPossibleMoves == 0 && !field.settingPhase) winner = field.curPlayer->id;
if (field.oppPlayer->numPossibleMoves == 0 && !field.settingPhase)
winner = field.curPlayer->id;
// next player
if (!field.stoneMustBeRemoved) setNextPlayer();
if (!field.stoneMustBeRemoved)
setNextPlayer();
// everything is ok
return true;
@ -612,9 +694,12 @@ bool Position::setCurrentGameState(fieldStruct *curState)
winner = 0;
movesDone = 0;
if ((field.curPlayer->numStones < 3) && (!field.settingPhase)) winner = field.oppPlayer->id;
if ((field.oppPlayer->numStones < 3) && (!field.settingPhase)) winner = field.curPlayer->id;
if ((field.curPlayer->numPossibleMoves == 0) && (!field.settingPhase)) winner = field.oppPlayer->id;
if ((field.curPlayer->numStones < 3) && (!field.settingPhase))
winner = field.oppPlayer->id;
if ((field.oppPlayer->numStones < 3) && (!field.settingPhase))
winner = field.curPlayer->id;
if ((field.curPlayer->numPossibleMoves == 0) && (!field.settingPhase))
winner = field.oppPlayer->id;
return true;
}
@ -628,43 +713,65 @@ bool Position::compareWithField(fieldStruct *compareField)
unsigned int i, j;
bool ret = true;
if (!comparePlayers(field.curPlayer, compareField->curPlayer)) {
cout << "error - curPlayer differs!" << endl; ret = false;
if (!comparePlayers(field.curPlayer, compareField->curPlayer))
{
cout << "error - curPlayer differs!" << endl;
ret = false;
}
if (!comparePlayers(field.oppPlayer, compareField->oppPlayer)) {
cout << "error - oppPlayer differs!" << endl; ret = false;
if (!comparePlayers(field.oppPlayer, compareField->oppPlayer))
{
cout << "error - oppPlayer differs!" << endl;
ret = false;
}
if (field.stonesSet != compareField->stonesSet) {
cout << "error - stonesSet differs!" << endl; ret = false;
if (field.stonesSet != compareField->stonesSet)
{
cout << "error - stonesSet differs!" << endl;
ret = false;
}
if (field.settingPhase != compareField->settingPhase) {
cout << "error - settingPhase differs!" << endl; ret = false;
if (field.settingPhase != compareField->settingPhase)
{
cout << "error - settingPhase differs!" << endl;
ret = false;
}
if (field.stoneMustBeRemoved != compareField->stoneMustBeRemoved) {
cout << "error - stoneMustBeRemoved differs!" << endl; ret = false;
if (field.stoneMustBeRemoved != compareField->stoneMustBeRemoved)
{
cout << "error - stoneMustBeRemoved differs!" << endl;
ret = false;
}
for (i = 0; i < field.size; i++) {
for (i = 0; i < field.size; i++)
{
if (field.board[i] != compareField->board[i]) {
cout << "error - board[] differs!" << endl; ret = false;
if (field.board[i] != compareField->board[i])
{
cout << "error - board[] differs!" << endl;
ret = false;
}
if (field.warnings[i] != compareField->warnings[i]) {
cout << "error - warnings[] differs!" << endl; ret = false;
if (field.warnings[i] != compareField->warnings[i])
{
cout << "error - warnings[] differs!" << endl;
ret = false;
}
if (field.stonePartOfMill[i] != compareField->stonePartOfMill[i]) {
cout << "error - stonePart[] differs!" << endl; ret = false;
if (field.stonePartOfMill[i] != compareField->stonePartOfMill[i])
{
cout << "error - stonePart[] differs!" << endl;
ret = false;
}
for (j = 0; j < 4; j++) {
for (j = 0; j < 4; j++)
{
if (field.connectedSquare[i][j] != compareField->connectedSquare[i][j]) {
cout << "error - connectedSquare[] differs!" << endl; ret = false;
if (field.connectedSquare[i][j] != compareField->connectedSquare[i][j])
{
cout << "error - connectedSquare[] differs!" << endl;
ret = false;
}
// if (board.stoneMoveAble[i][j] != compareField->stoneMoveAble[i][j]) { cout << "error - stoneMoveAble differs!" << endl; ret = false; }
if (field.neighbour[i][j / 2][j % 2] != compareField->neighbour[i][j / 2][j % 2]) {
cout << "error - neighbour differs!" << endl; ret = false;
if (field.neighbour[i][j / 2][j % 2] != compareField->neighbour[i][j / 2][j % 2])
{
cout << "error - neighbour differs!" << endl;
ret = false;
}
}
}
@ -681,20 +788,30 @@ bool Position::comparePlayers(Player *playerA, Player *playerB)
// unsigned int i;
bool ret = true;
if (playerA->numStonesMissing != playerB->numStonesMissing) {
cout << "error - numStonesMissing differs!" << endl; ret = false;
if (playerA->numStonesMissing != playerB->numStonesMissing)
{
cout << "error - numStonesMissing differs!" << endl;
ret = false;
}
if (playerA->numStones != playerB->numStones) {
cout << "error - numStones differs!" << endl; ret = false;
if (playerA->numStones != playerB->numStones)
{
cout << "error - numStones differs!" << endl;
ret = false;
}
if (playerA->id != playerB->id) {
cout << "error - id differs!" << endl; ret = false;
if (playerA->id != playerB->id)
{
cout << "error - id differs!" << endl;
ret = false;
}
if (playerA->warning != playerB->warning) {
cout << "error - warning differs!" << endl; ret = false;
if (playerA->warning != playerB->warning)
{
cout << "error - warning differs!" << endl;
ret = false;
}
if (playerA->numPossibleMoves != playerB->numPossibleMoves) {
cout << "error - numPossibleMoves differs!" << endl; ret = false;
if (playerA->numPossibleMoves != playerB->numPossibleMoves)
{
cout << "error - numPossibleMoves differs!" << endl;
ret = false;
}
// for (i=0; i<MAX_NUM_POS_MOVES; i++) if (playerA->posFrom[i] = playerB->posFrom[i]) return false;
@ -726,10 +843,12 @@ void Position::undo_move(void)
unsigned int i;
// at least one move must be done
if (movesDone) {
if (movesDone)
{
// make backup of log
for (i = 0; i < movesDone; i++) {
for (i = 0; i < movesDone; i++)
{
moveLogFrom_bak[i] = moveLogFrom[i];
moveLogTo_bak[i] = moveLogTo[i];
}
@ -740,7 +859,8 @@ void Position::undo_move(void)
movesDone = 0;
// and play again
for (i = 0; i < movesDone_bak - 1; i++) {
for (i = 0; i < movesDone_bak - 1; i++)
{
do_move(moveLogFrom_bak[i], moveLogTo_bak[i]);
}
}
@ -756,10 +876,13 @@ void Position::undo_move(void)
//-----------------------------------------------------------------------------
void Position::calcNumberOfRestingStones(int &numWhiteStonesResting, int &numBlackStonesResting)
{
if (getCurrentPlayer() == fieldStruct::playerTwo) {
if (getCurrentPlayer() == fieldStruct::playerTwo)
{
numWhiteStonesResting = fieldStruct::numStonesPerPlayer - field.curPlayer->numStonesMissing - field.curPlayer->numStones;
numBlackStonesResting = fieldStruct::numStonesPerPlayer - field.oppPlayer->numStonesMissing - field.oppPlayer->numStones;
} else {
}
else
{
numWhiteStonesResting = fieldStruct::numStonesPerPlayer - field.oppPlayer->numStonesMissing - field.oppPlayer->numStones;
numBlackStonesResting = fieldStruct::numStonesPerPlayer - field.curPlayer->numStonesMissing - field.curPlayer->numStones;
}

22
src/perfect/position.h
View File

@ -6,7 +6,6 @@
https://github.com/madweasel/madweasels-cpp
\*********************************************************************/
#ifndef MUEHLE_H
#define MUEHLE_H
@ -18,16 +17,28 @@
#include "types.h"
using namespace std;
/*** Konstanten ******************************************************/
#define MAX_NUM_MOVES 10000
/*** Makros ******************************************************/
#define SAFE_DELETE(p) { if(p) { delete (p); (p)=nullptr; } }
#define SAFE_DELETE_ARRAY(p) { if(p) { delete[] (p); (p)=nullptr; } }
#define SAFE_DELETE(p) \
{ \
if (p) \
{ \
delete (p); \
(p) = nullptr; \
} \
}
#define SAFE_DELETE_ARRAY(p) \
{ \
if (p) \
{ \
delete[](p); \
(p) = nullptr; \
} \
}
/*** Klassen *********************************************************/
@ -126,4 +137,3 @@ public:
};
#endif

37
src/perfect/randomAI.cpp
View File

@ -25,7 +25,6 @@ RandomAI::RandomAI()
RandomAI::~RandomAI()
{
// Locals
}
//-----------------------------------------------------------------------------
@ -39,41 +38,55 @@ void RandomAI::play(fieldStruct *theField, unsigned int *pushFrom, unsigned int
bool allowedToSpring = (theField->curPlayer->numStones == 3) ? true : false;
// must stone be removed ?
if (theField->stoneMustBeRemoved) {
if (theField->stoneMustBeRemoved)
{
// search a stone from the enemy
do {
do
{
from = rand() % theField->size;
to = theField->size;
} while (theField->board[from] != theField->oppPlayer->id || theField->stonePartOfMill[from]);
// still in setting phase ?
} else if (theField->settingPhase) {
}
else if (theField->settingPhase)
{
// search a free square
do {
do
{
from = theField->size;
to = rand() % theField->size;
} while (theField->board[to] != theField->squareIsFree);
// try to push randomly
} else {
}
else
{
do {
do
{
// search an own stone
do {
do
{
from = rand() % theField->size;
} while (theField->board[from] != theField->curPlayer->id);
// select a free square
if (allowedToSpring) {
do {
if (allowedToSpring)
{
do
{
to = rand() % theField->size;
} while (theField->board[to] != theField->squareIsFree);
// select a connected square
} else {
do {
}
else
{
do
{
direction = rand() % 4;
to = theField->connectedSquare[from][direction];
} while (to == theField->size);

336
src/perfect/strLib.cpp
View File

@ -54,11 +54,15 @@ MyString::MyString(const WCHAR *cStr)
//-----------------------------------------------------------------------------
MyString::~MyString()
{
if (strA != nullptr) {
delete[] strA; strA = nullptr;
if (strA != nullptr)
{
delete[] strA;
strA = nullptr;
}
if (strW != nullptr) {
delete[] strW; strW = nullptr;
if (strW != nullptr)
{
delete[] strW;
strW = nullptr;
}
strW = nullptr;
strA = nullptr;
@ -95,9 +99,12 @@ MyString &MyString::assign(const char *cStr)
size_t newLength = strlen(cStr);
size_t newReserved = (size_t)hibit((unsigned int)newLength) * 2;
if (reserved < newReserved) this->~MyString();
if (strA == nullptr) strA = new char[newReserved];
if (strW == nullptr) strW = new WCHAR[newReserved];
if (reserved < newReserved)
this->~MyString();
if (strA == nullptr)
strA = new char[newReserved];
if (strW == nullptr)
strW = new WCHAR[newReserved];
reserved = newReserved;
length = newLength;
@ -119,9 +126,12 @@ MyString &MyString::assign(const WCHAR *cStr)
size_t newLength = wcslen(cStr);
size_t newReserved = (size_t)hibit((unsigned int)newLength) * 2;
if (reserved < newReserved) this->~MyString();
if (strA == nullptr) strA = new char[newReserved];
if (strW == nullptr) strW = new WCHAR[newReserved];
if (reserved < newReserved)
this->~MyString();
if (strA == nullptr)
strA = new char[newReserved];
if (strW == nullptr)
strW = new WCHAR[newReserved];
reserved = newReserved;
length = newLength;
@ -170,10 +180,12 @@ bool readAsciiData(HANDLE hFile, double *pData, unsigned int numValues, unsigned
0.0000000001};
// read each value
do {
do
{
// read from buffer if necessary
if (curBufferPos >= bufferSize - maxValueLengthInBytes) {
if (curBufferPos >= bufferSize - maxValueLengthInBytes)
{
memcpy(&buffer[0], &buffer[curBufferPos], bufferSize - curBufferPos);
ReadFile(hFile, &buffer[bufferSize - curBufferPos], curBufferPos, &dwBytesRead, nullptr);
actualBufferSize = bufferSize - curBufferPos + dwBytesRead;
@ -182,105 +194,233 @@ bool readAsciiData(HANDLE hFile, double *pData, unsigned int numValues, unsigned
}
// process current byte
switch (*curByte) {
case '-': if (exponent) {
switch (*curByte)
{
case '-':
if (exponent)
{
expIsNegativ = true;
} else {
}
else
{
valIsNegativ = true;
} break;
case '+': /* ignore */ break;
case 'e': case 'E': exponent = true; decimalPlace = false; break;
case '0': if (decimalPlace) {
fractionalValue *= 10; fractionalValue += 0; decimalPos++;
} else if (exponent) {
exponentialValue *= 10; exponentialValue += 0;
} else {
integralValue *= 10; integralValue += 0;
} break;
case '1': if (decimalPlace) {
fractionalValue *= 10; fractionalValue += 1; decimalPos++;
} else if (exponent) {
exponentialValue *= 10; exponentialValue += 1;
} else {
integralValue *= 10; integralValue += 1;
} break;
case '2': if (decimalPlace) {
fractionalValue *= 10; fractionalValue += 2; decimalPos++;
} else if (exponent) {
exponentialValue *= 10; exponentialValue += 2;
} else {
integralValue *= 10; integralValue += 2;
} break;
case '3': if (decimalPlace) {
fractionalValue *= 10; fractionalValue += 3; decimalPos++;
} else if (exponent) {
exponentialValue *= 10; exponentialValue += 3;
} else {
integralValue *= 10; integralValue += 3;
} break;
case '4': if (decimalPlace) {
fractionalValue *= 10; fractionalValue += 4; decimalPos++;
} else if (exponent) {
exponentialValue *= 10; exponentialValue += 4;
} else {
integralValue *= 10; integralValue += 4;
} break;
case '5': if (decimalPlace) {
fractionalValue *= 10; fractionalValue += 5; decimalPos++;
} else if (exponent) {
exponentialValue *= 10; exponentialValue += 5;
} else {
integralValue *= 10; integralValue += 5;
} break;
case '6': if (decimalPlace) {
fractionalValue *= 10; fractionalValue += 6; decimalPos++;
} else if (exponent) {
exponentialValue *= 10; exponentialValue += 6;
} else {
integralValue *= 10; integralValue += 6;
} break;
case '7': if (decimalPlace) {
fractionalValue *= 10; fractionalValue += 7; decimalPos++;
} else if (exponent) {
exponentialValue *= 10; exponentialValue += 7;
} else {
integralValue *= 10; integralValue += 7;
} break;
case '8': if (decimalPlace) {
fractionalValue *= 10; fractionalValue += 8; decimalPos++;
} else if (exponent) {
exponentialValue *= 10; exponentialValue += 8;
} else {
integralValue *= 10; integralValue += 8;
} break;
case '9': if (decimalPlace) {
fractionalValue *= 10; fractionalValue += 9; decimalPos++;
} else if (exponent) {
exponentialValue *= 10; exponentialValue += 9;
} else {
integralValue *= 10; integralValue += 9;
} break;
}
break;
case '+': /* ignore */
break;
case 'e':
case 'E':
exponent = true;
decimalPlace = false;
break;
case '0':
if (decimalPlace)
{
fractionalValue *= 10;
fractionalValue += 0;
decimalPos++;
}
else if (exponent)
{
exponentialValue *= 10;
exponentialValue += 0;
}
else
{
integralValue *= 10;
integralValue += 0;
}
break;
case '1':
if (decimalPlace)
{
fractionalValue *= 10;
fractionalValue += 1;
decimalPos++;
}
else if (exponent)
{
exponentialValue *= 10;
exponentialValue += 1;
}
else
{
integralValue *= 10;
integralValue += 1;
}
break;
case '2':
if (decimalPlace)
{
fractionalValue *= 10;
fractionalValue += 2;
decimalPos++;
}
else if (exponent)
{
exponentialValue *= 10;
exponentialValue += 2;
}
else
{
integralValue *= 10;
integralValue += 2;
}
break;
case '3':
if (decimalPlace)
{
fractionalValue *= 10;
fractionalValue += 3;
decimalPos++;
}
else if (exponent)
{
exponentialValue *= 10;
exponentialValue += 3;
}
else
{
integralValue *= 10;
integralValue += 3;
}
break;
case '4':
if (decimalPlace)
{
fractionalValue *= 10;
fractionalValue += 4;
decimalPos++;
}
else if (exponent)
{
exponentialValue *= 10;
exponentialValue += 4;
}
else
{
integralValue *= 10;
integralValue += 4;
}
break;
case '5':
if (decimalPlace)
{
fractionalValue *= 10;
fractionalValue += 5;
decimalPos++;
}
else if (exponent)
{
exponentialValue *= 10;
exponentialValue += 5;
}
else
{
integralValue *= 10;
integralValue += 5;
}
break;
case '6':
if (decimalPlace)
{
fractionalValue *= 10;
fractionalValue += 6;
decimalPos++;
}
else if (exponent)
{
exponentialValue *= 10;
exponentialValue += 6;
}
else
{
integralValue *= 10;
integralValue += 6;
}
break;
case '7':
if (decimalPlace)
{
fractionalValue *= 10;
fractionalValue += 7;
decimalPos++;
}
else if (exponent)
{
exponentialValue *= 10;
exponentialValue += 7;
}
else
{
integralValue *= 10;
integralValue += 7;
}
break;
case '8':
if (decimalPlace)
{
fractionalValue *= 10;
fractionalValue += 8;
decimalPos++;
}
else if (exponent)
{
exponentialValue *= 10;
exponentialValue += 8;
}
else
{
integralValue *= 10;
integralValue += 8;
}
break;
case '9':
if (decimalPlace)
{
fractionalValue *= 10;
fractionalValue += 9;
decimalPos++;
}
else if (exponent)
{
exponentialValue *= 10;
exponentialValue += 9;
}
else
{
integralValue *= 10;
integralValue += 9;
}
break;
default:
if (*curByte == decimalSeperator) {
if (*curByte == decimalSeperator)
{
decimalPlace = true;
exponent = false;
} else if (*curByte == columnSeparator) {
}
else if (*curByte == columnSeparator)
{
// everything ok?
if (decimalPos > 8) {
if (decimalPos > 8)
{
cout << "ERROR in function readAsciiData(): Too many digits on decimal place. Maximum is 8 !" << endl;
return false;
}
// calc final value
(*pData) = integralValue;
if (decimalPos) {
if (decimalPos)
{
(*pData) += fractionalValue * fractionalFactor[decimalPos];
}
if (valIsNegativ) {
if (valIsNegativ)
{
(*pData) *= -1;
}
if (exponent) {
if (exponent)
{
(*pData) *= pow(10, expIsNegativ ? -1 * exponentialValue : 1);
}
@ -297,8 +437,9 @@ bool readAsciiData(HANDLE hFile, double *pData, unsigned int numValues, unsigned
// save value
pData++;
curReadValue++;
} else {
}
else
{
// do nothing
}
break;
@ -309,7 +450,8 @@ bool readAsciiData(HANDLE hFile, double *pData, unsigned int numValues, unsigned
curByte++;
// buffer overrun?
if (curBufferPos >= actualBufferSize) return false;
if (curBufferPos >= actualBufferSize)
return false;
} while (curReadValue < numValues);

2
src/perfect/strLib.h
View File

@ -24,7 +24,6 @@ bool readAsciiData(HANDLE hFile, double *pData, unsigned int numValues, unsigned
class MyString
{
private:
// variables
WCHAR *strW = nullptr;
char *strA = nullptr;
@ -34,7 +33,6 @@ private:
// functions
public:
// functions
MyString();
MyString(const char *cStr);

150
src/perfect/threadManager.cpp
View File

@ -32,7 +32,8 @@ ThreadManager::ThreadManager()
InitializeCriticalSection(&csBarrier);
hEventBarrierPassedByEveryBody = CreateEvent(nullptr, true, false, nullptr);
for (curThreadNo = 0; curThreadNo < numThreads; curThreadNo++) {
for (curThreadNo = 0; curThreadNo < numThreads; curThreadNo++)
{
hThread[curThreadNo] = nullptr;
threadId[curThreadNo] = 0;
hBarrier[curThreadNo] = CreateEvent(nullptr, false, false, nullptr);
@ -48,16 +49,23 @@ ThreadManager::~ThreadManager()
// locals
unsigned int curThreadNo;
for (curThreadNo = 0; curThreadNo < numThreads; curThreadNo++) {
for (curThreadNo = 0; curThreadNo < numThreads; curThreadNo++)
{
CloseHandle(hBarrier[curThreadNo]);
}
DeleteCriticalSection(&csBarrier);
CloseHandle(hEventBarrierPassedByEveryBody);
if (hBarrier != nullptr) delete[] hBarrier; hBarrier = nullptr;
if (hThread != nullptr) delete[] hThread; hThread = nullptr;
if (threadId != nullptr) delete[] threadId; threadId = nullptr;
if (hBarrier != nullptr)
delete[] hBarrier;
hBarrier = nullptr;
if (hThread != nullptr)
delete[] hThread;
hThread = nullptr;
if (threadId != nullptr)
delete[] threadId;
threadId = nullptr;
}
//-----------------------------------------------------------------------------
@ -68,7 +76,8 @@ void ThreadManager::waitForOtherThreads(unsigned int threadNo)
{
// wait if other threads are still waiting at the barrier
//cout << endl << "thread=" << threadNo << ", numThreadsPassedBarrier= " << numThreadsPassedBarrier << ": " << "while (numThreadsPassedBarrier>0)";
if (numThreadsPassedBarrier > 0) {
if (numThreadsPassedBarrier > 0)
{
WaitForSingleObject(hEventBarrierPassedByEveryBody, INFINITE);
}
@ -83,7 +92,8 @@ void ThreadManager::waitForOtherThreads(unsigned int threadNo)
EnterCriticalSection(&csBarrier);
// if the first one which entered, then wait until other threads
if (numThreadsPassedBarrier == 0) {
if (numThreadsPassedBarrier == 0)
{
//cout << endl << "thread=" << threadNo << ", numThreadsPassedBarrier= " << numThreadsPassedBarrier << ": " << "WaitForMultipleObjects()";
WaitForMultipleObjects(numThreads, hBarrier, TRUE, INFINITE);
ResetEvent(hEventBarrierPassedByEveryBody);
@ -95,7 +105,8 @@ void ThreadManager::waitForOtherThreads(unsigned int threadNo)
// the last one closes the door
//cout << endl << "thread=" << threadNo << ", numThreadsPassedBarrier= " << numThreadsPassedBarrier << ": " << "if (numThreadsPassedBarrier == numThreads) numThreadsPassedBarrier = 0";
if (numThreadsPassedBarrier == numThreads) {
if (numThreadsPassedBarrier == numThreads)
{
numThreadsPassedBarrier = 0;
SetEvent(hEventBarrierPassedByEveryBody);
}
@ -121,14 +132,18 @@ bool ThreadManager::setNumThreads(unsigned int newNumThreads)
{
// cancel if any thread running
EnterCriticalSection(&csBarrier);
for (unsigned int curThreadNo = 0; curThreadNo < numThreads; curThreadNo++) {
if (hThread[curThreadNo]) return false;
for (unsigned int curThreadNo = 0; curThreadNo < numThreads; curThreadNo++)
{
if (hThread[curThreadNo])
return false;
}
for (unsigned int curThreadNo = 0; curThreadNo < numThreads; curThreadNo++) {
for (unsigned int curThreadNo = 0; curThreadNo < numThreads; curThreadNo++)
{
CloseHandle(hBarrier[curThreadNo]);
}
numThreads = newNumThreads;
for (unsigned int curThreadNo = 0; curThreadNo < numThreads; curThreadNo++) {
for (unsigned int curThreadNo = 0; curThreadNo < numThreads; curThreadNo++)
{
hBarrier[curThreadNo] = CreateEvent(nullptr, false, false, nullptr);
}
LeaveCriticalSection(&csBarrier);
@ -141,13 +156,17 @@ bool ThreadManager::setNumThreads(unsigned int newNumThreads)
//-----------------------------------------------------------------------------
void ThreadManager::pauseExecution()
{
for (unsigned int curThread = 0; curThread < numThreads; curThread++) {
for (unsigned int curThread = 0; curThread < numThreads; curThread++)
{
// unsuspend all threads
if (!executionPaused) {
if (!executionPaused)
{
SuspendThread(hThread[curThread]);
// suspend all threads
} else {
}
else
{
ResumeThread(hThread[curThread]);
}
}
@ -163,7 +182,8 @@ void ThreadManager::cancelExecution()
{
termineAllThreads = true;
executionCancelled = true;
if (executionPaused) {
if (executionPaused)
{
pauseExecution();
}
}
@ -196,8 +216,10 @@ unsigned int ThreadManager::getThreadNumber()
DWORD curThreadId = GetCurrentThreadId();
unsigned int curThreadNo;
for (curThreadNo = 0; curThreadNo < numThreads; curThreadNo++) {
if (curThreadId == threadId[curThreadNo]) {
for (curThreadNo = 0; curThreadNo < numThreads; curThreadNo++)
{
if (curThreadId == threadId[curThreadNo])
{
return curThreadNo;
}
}
@ -215,19 +237,23 @@ unsigned int ThreadManager::executeInParallel(DWORD threadProc(void *pParameter
SIZE_T dwStackSize = 0;
// parameters ok?
if (pParameter == nullptr) return TM_RETURN_VALUE_INVALID_PARAM;
if (pParameter == nullptr)
return TM_RETURN_VALUE_INVALID_PARAM;
// globals
termineAllThreads = false;
// create threads
for (curThreadNo = 0; curThreadNo < numThreads; curThreadNo++) {
for (curThreadNo = 0; curThreadNo < numThreads; curThreadNo++)
{
hThread[curThreadNo] = CreateThread(nullptr, dwStackSize, (LPTHREAD_START_ROUTINE)threadProc, (void *)(((char *)pParameter) + curThreadNo * parameterStructSize), CREATE_SUSPENDED, &threadId[curThreadNo]);
SetThreadPriority(hThread[curThreadNo], THREAD_PRIORITY_BELOW_NORMAL);
if (hThread[curThreadNo] == nullptr) {
for (curThreadNo; curThreadNo > 0; curThreadNo--) {
if (hThread[curThreadNo] == nullptr)
{
for (curThreadNo; curThreadNo > 0; curThreadNo--)
{
CloseHandle(hThread[curThreadNo - 1]);
hThread[curThreadNo - 1] = nullptr;
}
@ -236,24 +262,30 @@ unsigned int ThreadManager::executeInParallel(DWORD threadProc(void *pParameter
}
// start threads
for (curThreadNo = 0; curThreadNo < numThreads; curThreadNo++) {
if (!executionPaused) ResumeThread(hThread[curThreadNo]);
for (curThreadNo = 0; curThreadNo < numThreads; curThreadNo++)
{
if (!executionPaused)
ResumeThread(hThread[curThreadNo]);
}
// wait for every thread to end
WaitForMultipleObjects(numThreads, hThread, TRUE, INFINITE);
// Close all thread handles upon completion.
for (curThreadNo = 0; curThreadNo < numThreads; curThreadNo++) {
for (curThreadNo = 0; curThreadNo < numThreads; curThreadNo++)
{
CloseHandle(hThread[curThreadNo]);
hThread[curThreadNo] = nullptr;
threadId[curThreadNo] = 0;
}
// everything ok
if (executionCancelled) {
if (executionCancelled)
{
return TM_RETURN_VALUE_EXECUTION_CANCELLED;
} else {
}
else
{
return TM_RETURN_VALUE_OK;
}
}
@ -273,11 +305,16 @@ unsigned int ThreadManager::executeParallelLoop(DWORD threadProc(void *pParam
int inkrement)
{
// parameters ok?
if (executionCancelled == true) return TM_RETURN_VALUE_EXECUTION_CANCELLED;
if (pParameter == nullptr) return TM_RETURN_VALUE_INVALID_PARAM;
if (scheduleType >= TM_SCHEDULE_NUM_TYPES) return TM_RETURN_VALUE_INVALID_PARAM;
if (inkrement == 0) return TM_RETURN_VALUE_INVALID_PARAM;
if (abs(finalValue - initialValue) == abs(inkrement)) return TM_RETURN_VALUE_INVALID_PARAM;
if (executionCancelled == true)
return TM_RETURN_VALUE_EXECUTION_CANCELLED;
if (pParameter == nullptr)
return TM_RETURN_VALUE_INVALID_PARAM;
if (scheduleType >= TM_SCHEDULE_NUM_TYPES)
return TM_RETURN_VALUE_INVALID_PARAM;
if (inkrement == 0)
return TM_RETURN_VALUE_INVALID_PARAM;
if (abs(finalValue - initialValue) == abs(inkrement))
return TM_RETURN_VALUE_INVALID_PARAM;
// locals
unsigned int curThreadNo; // the threads are enumerated from 0 to numThreads-1
@ -290,7 +327,8 @@ unsigned int ThreadManager::executeParallelLoop(DWORD threadProc(void *pParam
termineAllThreads = false;
// create threads
for (curThreadNo = 0; curThreadNo < numThreads; curThreadNo++) {
for (curThreadNo = 0; curThreadNo < numThreads; curThreadNo++)
{
forLoopParameters[curThreadNo].pParameter = (pParameter != nullptr ? (void *)(((char *)pParameter) + curThreadNo * parameterStructSize) : nullptr);
forLoopParameters[curThreadNo].threadManager = this;
@ -298,12 +336,16 @@ unsigned int ThreadManager::executeParallelLoop(DWORD threadProc(void *pParam
forLoopParameters[curThreadNo].inkrement = inkrement;
forLoopParameters[curThreadNo].scheduleType = scheduleType;
switch (scheduleType) {
switch (scheduleType)
{
case TM_SCHEDULE_STATIC:
chunkSize = numIterations / numThreads + (curThreadNo < numIterations % numThreads ? 1 : 0);
if (curThreadNo == 0) {
if (curThreadNo == 0)
{
forLoopParameters[curThreadNo].initialValue = initialValue;
} else {
}
else
{
forLoopParameters[curThreadNo].initialValue = forLoopParameters[curThreadNo - 1].finalValue + 1;
}
forLoopParameters[curThreadNo].finalValue = forLoopParameters[curThreadNo].initialValue + chunkSize - 1;
@ -322,8 +364,10 @@ unsigned int ThreadManager::executeParallelLoop(DWORD threadProc(void *pParam
// create suspended thread
hThread[curThreadNo] = CreateThread(nullptr, dwStackSize, threadForLoop, (LPVOID)(&forLoopParameters[curThreadNo]), CREATE_SUSPENDED, &threadId[curThreadNo]);
SetThreadPriority(hThread[curThreadNo], THREAD_PRIORITY_BELOW_NORMAL);
if (hThread[curThreadNo] == nullptr) {
for (curThreadNo; curThreadNo > 0; curThreadNo--) {
if (hThread[curThreadNo] == nullptr)
{
for (curThreadNo; curThreadNo > 0; curThreadNo--)
{
CloseHandle(hThread[curThreadNo - 1]);
hThread[curThreadNo - 1] = nullptr;
}
@ -334,15 +378,18 @@ unsigned int ThreadManager::executeParallelLoop(DWORD threadProc(void *pParam
}
// start threads, but don't resume if in pause mode
for (curThreadNo = 0; curThreadNo < numThreads; curThreadNo++) {
if (!executionPaused) ResumeThread(hThread[curThreadNo]);
for (curThreadNo = 0; curThreadNo < numThreads; curThreadNo++)
{
if (!executionPaused)
ResumeThread(hThread[curThreadNo]);
}
// wait for every thread to end
WaitForMultipleObjects(numThreads, hThread, TRUE, INFINITE);
// Close all thread handles upon completion.
for (curThreadNo = 0; curThreadNo < numThreads; curThreadNo++) {
for (curThreadNo = 0; curThreadNo < numThreads; curThreadNo++)
{
CloseHandle(hThread[curThreadNo]);
hThread[curThreadNo] = nullptr;
threadId[curThreadNo] = 0;
@ -350,9 +397,12 @@ unsigned int ThreadManager::executeParallelLoop(DWORD threadProc(void *pParam
delete[] forLoopParameters;
// everything ok
if (executionCancelled) {
if (executionCancelled)
{
return TM_RETURN_VALUE_EXECUTION_CANCELLED;
} else {
}
else
{
return TM_RETURN_VALUE_OK;
}
}
@ -367,10 +417,13 @@ DWORD WINAPI ThreadManager::threadForLoop(LPVOID lpParameter)
ForLoop *forLoopParameters = (ForLoop *)lpParameter;
int index;
switch (forLoopParameters->scheduleType) {
switch (forLoopParameters->scheduleType)
{
case TM_SCHEDULE_STATIC:
for (index = forLoopParameters->initialValue; (forLoopParameters->inkrement < 0) ? index >= forLoopParameters->finalValue : index <= forLoopParameters->finalValue; index += forLoopParameters->inkrement) {
switch (forLoopParameters->threadProc(forLoopParameters->pParameter, index)) {
for (index = forLoopParameters->initialValue; (forLoopParameters->inkrement < 0) ? index >= forLoopParameters->finalValue : index <= forLoopParameters->finalValue; index += forLoopParameters->inkrement)
{
switch (forLoopParameters->threadProc(forLoopParameters->pParameter, index))
{
case TM_RETURN_VALUE_OK:
break;
case TM_RETURN_VALUE_TERMINATE_ALL_THREADS:
@ -379,7 +432,8 @@ DWORD WINAPI ThreadManager::threadForLoop(LPVOID lpParameter)
default:
break;
}
if (forLoopParameters->threadManager->termineAllThreads) break;
if (forLoopParameters->threadManager->termineAllThreads)
break;
}
break;
case TM_SCHEDULE_DYNAMIC:
@ -397,6 +451,6 @@ DWORD WINAPI ThreadManager::threadForLoop(LPVOID lpParameter)
}
/*** To Do's ********************************************************************************
- Beschränkung auf 'int' kann zu Überlauf führen, wenn mehr states in einer layer vorliegen.
- Beschr<EFBFBD>nkung auf 'int' kann zu <EFBFBD>berlauf f<EFBFBD>hren, wenn mehr states in einer layer vorliegen.
==> Vielleicht mit class templates arbeiten
*********************************************************************************************/

29
src/perfect/threadManager.h
View File

@ -39,7 +39,6 @@ using namespace std; // use standard library namespace
class ThreadManager
{
private:
// structures
struct ForLoop
{
@ -48,7 +47,8 @@ private:
int initialValue;
int finalValue;
void *pParameter;
DWORD(*threadProc)(void *pParameter, int index); // pointer to the user function to be executed by the threads
DWORD (*threadProc)
(void *pParameter, int index); // pointer to the user function to be executed by the threads
ThreadManager *threadManager;
};
@ -70,24 +70,18 @@ private:
static DWORD WINAPI threadForLoop(LPVOID lpParameter);
public:
class ThreadVarsArrayItem
{
public:
unsigned int curThreadNo;
virtual void initializeElement()
{
};
virtual void destroyElement()
{
};
virtual void reduce()
{
};
virtual void initializeElement(){};
virtual void destroyElement(){};
virtual void reduce(){};
};
template <class varType> class ThreadVarsArray
template <class varType>
class ThreadVarsArray
{
public:
unsigned int numberOfThreads;
@ -98,7 +92,8 @@ public:
this->numberOfThreads = numberOfThreads;
this->item = new varType[numberOfThreads];
for (unsigned int threadCounter = 0; threadCounter < numberOfThreads; threadCounter++) {
for (unsigned int threadCounter = 0; threadCounter < numberOfThreads; threadCounter++)
{
item[threadCounter].curThreadNo = threadCounter;
item[threadCounter].initializeElement(master);
item[threadCounter].curThreadNo = threadCounter; // if 'curThreadNo' is overwritten in 'initializeElement()'
@ -107,7 +102,8 @@ public:
~ThreadVarsArray()
{
for (unsigned int threadCounter = 0; threadCounter < numberOfThreads; threadCounter++) {
for (unsigned int threadCounter = 0; threadCounter < numberOfThreads; threadCounter++)
{
item[threadCounter].destroyElement();
}
delete[] item;
@ -125,7 +121,8 @@ public:
void reduce()
{
for (unsigned int threadCounter = 0; threadCounter < numberOfThreads; threadCounter++) {
for (unsigned int threadCounter = 0; threadCounter < numberOfThreads; threadCounter++)
{
item[threadCounter].reduce();
}
};