![]() |
Knight's Tour Generator
Tourneys and the Fast Generation and Obfuscation of Closed Knight's Tours
|
Base tours for the divide-and-conquer generation algorithm. More...
#include <Tile.h>
Public Member Functions | |
CTile () | |
Constructor. More... | |
~CTile () | |
Destructor. More... | |
Protected Attributes | |
CBoard * | m_pTile6x6 = nullptr |
Pointer to a 6x6 chessboard. | |
CBoard * | m_pTile6x8 = nullptr |
Pointer to a 6x8 chessboard. | |
CBoard * | m_pTile8x6 = nullptr |
Pointer to an 8x6 chessboard. | |
CBoard * | m_pTile8x8 = nullptr |
Pointer to an 8x8 chessboard. | |
CBoard * | m_pTile8x10 = nullptr |
Pointer to an 8x10 chessboard. | |
CBoard * | m_pTile10x8 = nullptr |
Pointer to a 10x8 chessboard. | |
CBoard * | m_pTile10x10 = nullptr |
Pointer to a 10x10 chessboard. | |
CBoard * | m_pTile10x12 = nullptr |
Pointer to a 10x12 chessboard. | |
CBoard * | m_pTile12x10 = nullptr |
Pointer to a 12x10 chessboard. | |
Static Private Attributes | |
static int | m_nTile6x6 [36] |
6x6 move table. More... | |
static int | m_nTile6x8 [48] |
6x8 move table. More... | |
static int | m_nTile8x6 [48] |
8x6 move table. More... | |
static int | m_nTile8x8 [64] |
8x8 move table. More... | |
static int | m_nTile8x10 [80] |
8x10 move table. More... | |
static int | m_nTile10x8 [80] |
10x8 move table. More... | |
static int | m_nTile10x10 [100] |
10x10 move table. More... | |
static int | m_nTile10x12 [120] |
10x12 move table. More... | |
static int | m_nTile12x10 [120] |
12x10 move table. More... | |
These are the closed knight's tours at the base of the recursive generation algorithm in CDivideAndConquer. See I. Parberry, "An efficient algorithm for the knight's tour problem", Discrete Applied Mathematics, 73:251-260,
CTile::CTile | ( | ) |
CTile::~CTile | ( | ) |
|
staticprivate |
|
staticprivate |
|
staticprivate |
|
staticprivate |
|
staticprivate |
|
staticprivate |
|
staticprivate |
|
staticprivate |
|
staticprivate |