cs3243-project's People
cs3243-project's Issues
Use bitwise operations to optimize performance
Reference: Tetris: A Heuristic Study
Unlimited generations
For 5 heuristics parallel 5 11 row jobs
Parallel/distributed learning on multiple cores/machines
Genetic algorithm runs very slowly, could use multithreading to speed it up.
ref: http://www.michaelnoven.se/reports/tetris.pdf
- Each candidate(vector) should be run many times and either 1) take the average score or 2) take the best of those runs. Currently each candidate only uses the fitness from a single run resulting in highly variable results. This process can be parallelized
Print out generation data to separate files
Print out each generation's weights and fitness into .txt files for documentation
Move 4 heuristic 11 rows jobs to /temp
Weight tester
After optimal heuristic weights are obtained, they need to be tested for their average, min and max fitness for report. Should be started at least 1-2 days before report submission.
- Can be done by running ~100(?) plays in parallel
More heuristics?
Current heuristics may not be enough to achieve global maximum.
Other promising heuristics:
- Blockades
Obtain new optimal weights with depth-2 search
Run genetic learner on depth-2 search either using SoC computing clusters or AWS servers to obtain new optimal constants for heuristics
Blockade heuristic
Discussion:
- Include or not to include
- If include, penalise linearly (current implementation) or polynomially/exponentially?
Depth-2 search
Write report
- Refine heuristics section especially pictures and captions (well sum, bumpiness, aggregate height) and add more formulas (bumpiness, aggregate height and blockades). ref: https://codemyroad.wordpress.com/2013/04/14/tetris-ai-the-near-perfect-player/
- Speedup section in parallelization
- Results section (include num generations ran, runtime on cluster)
- Conclusion (4heu vs 5heu, para5 vs para10, 11 rows vs 21 rows (hypothesis: 21 allows itself to be more lax, relying on luck to fix itself at high heights), maybe mention about how the quality of init pop matters a lot?)
Hardcode into initial population strong candidate vectors
Recommend Projects
-
React
A declarative, efficient, and flexible JavaScript library for building user interfaces.
-
Vue.js
๐ Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
-
Typescript
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
-
TensorFlow
An Open Source Machine Learning Framework for Everyone
-
Django
The Web framework for perfectionists with deadlines.
-
Laravel
A PHP framework for web artisans
-
D3
Bring data to life with SVG, Canvas and HTML. ๐๐๐
-
Recommend Topics
-
javascript
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
-
web
Some thing interesting about web. New door for the world.
-
server
A server is a program made to process requests and deliver data to clients.
-
Machine learning
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
-
Visualization
Some thing interesting about visualization, use data art
-
Game
Some thing interesting about game, make everyone happy.
Recommend Org
-
Facebook
We are working to build community through open source technology. NB: members must have two-factor auth.
-
Microsoft
Open source projects and samples from Microsoft.
-
Google
Google โค๏ธ Open Source for everyone.
-
Alibaba
Alibaba Open Source for everyone
-
D3
Data-Driven Documents codes.
-
Tencent
China tencent open source team.