mirror of https://github.com/dnomd343/klotski.git
Dnomd343
3 weeks ago
9 changed files with 302 additions and 347 deletions
@ -1,105 +1,105 @@ |
|||||
#include "fast_cal/fast_cal.h" |
#include "fast_cal/fast_cal.h" |
||||
|
|
||||
MaskMover FastCal::init(uint64_t code) { // initialize process
|
// MaskMover FastCal::init(uint64_t code) { // initialize process
|
||||
/// reset working data
|
// /// reset working data
|
||||
cases.clear(); |
// cases.clear();
|
||||
cases.reserve(FC_MAP_RESERVE); // hashmap pre-reserve
|
// cases.reserve(FC_MAP_RESERVE); // hashmap pre-reserve
|
||||
std::queue<fast_cal_t*>{}.swap(cache); |
// std::queue<fast_cal_t*>{}.swap(cache);
|
||||
|
//
|
||||
/// insert root node
|
// /// insert root node
|
||||
cache.emplace(&cases.emplace(code, fast_cal_t { |
// cache.emplace(&cases.emplace(code, fast_cal_t {
|
||||
.code = code, |
// .code = code,
|
||||
.mask = 0, |
// .mask = 0,
|
||||
.last = nullptr, // without parent node
|
// .last = nullptr, // without parent node
|
||||
}).first->second); |
// }).first->second);
|
||||
|
//
|
||||
/// import klotski mover
|
// /// import klotski mover
|
||||
return MaskMover( |
// return MaskMover(
|
||||
[this](auto &&code, auto &&mask) { // lambda as function pointer
|
// [this](auto &&code, auto &&mask) { // lambda as function pointer
|
||||
new_case(std::forward<decltype(code)>(code), std::forward<decltype(mask)>(mask)); |
// new_case(std::forward<decltype(code)>(code), std::forward<decltype(mask)>(mask));
|
||||
} |
// }
|
||||
); |
// );
|
||||
} |
// }
|
||||
|
|
||||
/// callback function for new case
|
/// callback function for new case
|
||||
void FastCal::new_case(uint64_t code, uint64_t mask) { |
// void FastCal::new_case(uint64_t code, uint64_t mask) {
|
||||
auto current = cases.find(code); |
// auto current = cases.find(code);
|
||||
if (current != cases.end()) { // find existed case
|
// if (current != cases.end()) { // find existed case
|
||||
current->second.mask |= mask; // update mask info
|
// current->second.mask |= mask; // update mask info
|
||||
return; |
// return;
|
||||
} |
// }
|
||||
cache.emplace(&cases.emplace(code, fast_cal_t { // record new case
|
// cache.emplace(&cases.emplace(code, fast_cal_t { // record new case
|
||||
.code = code, |
// .code = code,
|
||||
.mask = mask, |
// .mask = mask,
|
||||
.last = cache.front(), // link parent case
|
// .last = cache.front(), // link parent case
|
||||
}).first->second); |
// }).first->second);
|
||||
} |
// }
|
||||
|
|
||||
/// build total search tree
|
/// build total search tree
|
||||
void FastCal::build() { |
// void FastCal::build() {
|
||||
auto core = init(root); |
// auto core = init(root);
|
||||
while (!cache.empty()) { |
// while (!cache.empty()) {
|
||||
core.next_cases(cache.front()->code, cache.front()->mask); |
// core.next_cases(cache.front()->code, cache.front()->mask);
|
||||
cache.pop(); |
// cache.pop();
|
||||
} |
// }
|
||||
} |
// }
|
||||
|
|
||||
/// found first matched target
|
/// found first matched target
|
||||
RawCode FastCal::target(const match_t &match) { |
// RawCode FastCal::target(const match_t &match) {
|
||||
auto core = init(root); |
// auto core = init(root);
|
||||
while (!cache.empty()) { |
// while (!cache.empty()) {
|
||||
if (match(cache.front()->code)) { |
// if (match(cache.front()->code)) {
|
||||
return RawCode::unsafe_create(cache.front()->code); // match target
|
// return RawCode::unsafe_create(cache.front()->code); // match target
|
||||
} |
// }
|
||||
core.next_cases(cache.front()->code, cache.front()->mask); |
// core.next_cases(cache.front()->code, cache.front()->mask);
|
||||
cache.pop(); |
// cache.pop();
|
||||
} |
// }
|
||||
return FC_NOT_FOUND; // target not found
|
// return FC_NOT_FOUND; // target not found
|
||||
} |
// }
|
||||
|
|
||||
/// found all of the furthest cases
|
/// found all of the furthest cases
|
||||
std::vector<RawCode> FastCal::furthest() { |
// std::vector<RawCode> FastCal::furthest() {
|
||||
auto core = init(root); |
// auto core = init(root);
|
||||
auto layer_end = cache.back(); |
// auto layer_end = cache.back();
|
||||
std::vector<RawCode> layer_cases; |
// std::vector<RawCode> layer_cases;
|
||||
/// start BFS search
|
// /// start BFS search
|
||||
while (!cache.empty()) { |
// while (!cache.empty()) {
|
||||
core.next_cases(cache.front()->code, cache.front()->mask); |
// core.next_cases(cache.front()->code, cache.front()->mask);
|
||||
layer_cases.emplace_back( |
// layer_cases.emplace_back(
|
||||
RawCode::unsafe_create(cache.front()->code) // record layer cases
|
// RawCode::unsafe_create(cache.front()->code) // record layer cases
|
||||
); |
// );
|
||||
if (cache.front() == layer_end) { // reach layer ending
|
// if (cache.front() == layer_end) { // reach layer ending
|
||||
if (cache.size() == 1) { |
// if (cache.size() == 1) {
|
||||
break; // stop loop at last layer
|
// break; // stop loop at last layer
|
||||
} |
// }
|
||||
layer_cases.clear(); |
// layer_cases.clear();
|
||||
layer_end = cache.back(); // reset layer ending
|
// layer_end = cache.back(); // reset layer ending
|
||||
} |
// }
|
||||
cache.pop(); |
// cache.pop();
|
||||
} |
// }
|
||||
return layer_cases; // release the latest layer cases
|
// return layer_cases; // release the latest layer cases
|
||||
} |
// }
|
||||
|
|
||||
/// found multi-targets matched in first same layer
|
/// found multi-targets matched in first same layer
|
||||
std::vector<RawCode> FastCal::target_multi(const match_t &match) { |
// std::vector<RawCode> FastCal::target_multi(const match_t &match) {
|
||||
auto core = init(root); |
// auto core = init(root);
|
||||
auto layer_end = cache.back(); |
// auto layer_end = cache.back();
|
||||
std::vector<RawCode> matched; // matched list
|
// std::vector<RawCode> matched; // matched list
|
||||
/// start BFS search
|
// /// start BFS search
|
||||
while (!cache.empty()) { |
// while (!cache.empty()) {
|
||||
if (match(cache.front()->code)) { // match target
|
// if (match(cache.front()->code)) { // match target
|
||||
matched.emplace_back( |
// matched.emplace_back(
|
||||
RawCode::unsafe_create(cache.front()->code) // record matched cases
|
// RawCode::unsafe_create(cache.front()->code) // record matched cases
|
||||
); |
// );
|
||||
} |
// }
|
||||
core.next_cases(cache.front()->code, cache.front()->mask); |
// core.next_cases(cache.front()->code, cache.front()->mask);
|
||||
if (cache.front() == layer_end) { // reach layer ending
|
// if (cache.front() == layer_end) { // reach layer ending
|
||||
if (!matched.empty()) { |
// if (!matched.empty()) {
|
||||
return matched; // stop at first matched layer
|
// return matched; // stop at first matched layer
|
||||
} |
// }
|
||||
layer_end = cache.back(); // reset layer ending
|
// layer_end = cache.back(); // reset layer ending
|
||||
} |
// }
|
||||
cache.pop(); |
// cache.pop();
|
||||
} |
// }
|
||||
return std::vector<RawCode>{}; // no target found
|
// return std::vector<RawCode>{}; // no target found
|
||||
} |
// }
|
||||
|
|||||
@ -0,0 +1,43 @@ |
|||||
|
/// Klotski Engine by Dnomd343 @2024
|
||||
|
|
||||
|
#pragma once |
||||
|
|
||||
|
#include <vector> |
||||
|
#include <cstdint> |
||||
|
|
||||
|
namespace klotski { |
||||
|
|
||||
|
template <typename T> |
||||
|
class LayerQueue { |
||||
|
public: |
||||
|
LayerQueue(size_t reserve, std::initializer_list<T> first_layer); |
||||
|
|
||||
|
void emplace(T item); |
||||
|
|
||||
|
T current() const; |
||||
|
|
||||
|
void next(); |
||||
|
|
||||
|
[[nodiscard]] bool is_ending() const; |
||||
|
|
||||
|
[[nodiscard]] bool is_new_layer() const; |
||||
|
|
||||
|
std::vector<T> layer_cases() const; |
||||
|
|
||||
|
// TODO: allow export all layers
|
||||
|
|
||||
|
private: |
||||
|
size_t queue_begin_ {0}; |
||||
|
size_t queue_end_ {0}; |
||||
|
|
||||
|
size_t layer_begin_ {0}; |
||||
|
size_t layer_end_ {0}; |
||||
|
|
||||
|
std::vector<T> data_ {}; |
||||
|
|
||||
|
std::vector<std::pair<size_t, size_t>> layers_ {}; |
||||
|
}; |
||||
|
|
||||
|
} // namespace klotski
|
||||
|
|
||||
|
#include "internal/layer_queue.inl" |
||||
Loading…
Reference in new issue