Initial commit, basic class organization defined.
Started implementing piece representation.
Read and write back boards
Fixed bitboard generation
Move generation is working
A* working. Extremely slow and memory consuming.
Receive in constant reference to evctor. No difference, probably compiler already optimized it.
Fix error generating board paths, only shows with -O2 -O3
Using unordered_map and manually sorted vector as priority_queue. Eliminated Node class. Everything is handled as a pointer to avoid copies.
Cache H value. Fixed some memory management.
Piece is now only 7 bits (+ padding), row and col, the rest is shared. Using bitfields and unions.
Added time measurements and correctly reorder priority_queue after deleting nodes.
Everything is constant in State class.
Cache hash in State.
Break ties with G when comparing F. Added SMA*, commented out.
Add puzzles
Reconstruct moves for printing.
H=0 for goal;
Update node in open list instead of delete/insert.
changed unordered_map to unordered_set.