-
Implement a heuristic finding algorithm for 15-puzzle problem using any method of abstractions or relaxations. The heuristic should enable solving problems of size greater than n=5 (which at the moment I am able to solve optimally) and at least n=9. (0 %)
- reading (100%)
- implementation (1%)
- status: in progress
-
Read Goedel, Escher, Bach (174/832 ~ 21%)
- status: in progress
-
Universally Preferable Behavior
- reading 100%
- 1st analysis (100%)
- read articles against UPB [1] (3/5 ~ 60%), [2] (3/5 ~ 60%)
- related articles
- Speciesism wiki
- Speciesism and the Idea of Equality by Bonnie Steinbock, discussion (100%)
- Against Against “Humanism”: Speciesism, Personhood, and Preference by Simon Cushing (0%)
- The Molyneux Problem by David Gordon (0%)
- formalization of UPB (0%)
- status: in progress
-
BitShares challenge: Special Random Shuffling
- design of optimal solution (100%)
- c++ code implementation (100%)
- asymptotic performance optimization (100%)
- status: waiting for challenge results
-
Data science tasks with $$ prizes