Move tables are used to store a small number of best moves. They have the usual operations Insert, Delete, etc.
Definition in file SgSortedMoves.h.
#include <iostream>
#include "SgRandom.h"
#include "SgVector.h"
Go to the source code of this file.
Classes | |
| class | SgSortedMoves< MOVE, VALUE, SIZE > |
| Small array with moves sorted by their value. More... | |
Functions | |
| template<typename MOVE, typename VALUE, int SIZE> | |
| std::ostream & | operator<< (std::ostream &str, const SgSortedMoves< MOVE, VALUE, SIZE > &m) |
| write all moves in the table and their values | |
| std::ostream& operator<< | ( | std::ostream & | str, | |
| const SgSortedMoves< MOVE, VALUE, SIZE > & | m | |||
| ) |
write all moves in the table and their values
Definition at line 390 of file SgSortedMoves.h.
References SgSortedMoves< MOVE, VALUE, SIZE >::Move(), SgSortedMoves< MOVE, VALUE, SIZE >::NuMoves(), and SgSortedMoves< MOVE, VALUE, SIZE >::Value().