created some extremely unoptimal code (exponential time complexity) for stockship. Takes around 10 minutes to run lol.
definitely optimizing, or setting as a forbidden setting option buried deep in a menu if I can't optimize it
I have been doing this over the course of 2 days, but only now have I decided to post. I'm making a program that uses monte carlo simulations to find the best move in Battleship. UI attached below
Doing competitive programming homework. I'm going to do more but I'm scared I'll forget to post after i finish the homework.
came up with a basic idea for a new project
Most of my day today was spent doing an essay, but I also did some of my AOPS homework.
Tried some homework. I am extremely demotivated for some reason; hopefully it'll get better 😐
I ran a lot today, and also did some flashcards (no coding projects as I have essays and homework)
Sorry for not posting that much, vacation got in the way!
Traveled to Boston
Learnt about bitwise operations (im kinda sick so this is lower effort)
Just taught my friends at school about binary lifting
today I learnt to use the floyd-warshall algorithm to find the nodes on the shortest paths between nodes.
Still working out specifics, as you can see😉
Practiced usaco today! It was mostly reading, but I was able to apply my knowledge to solve this problem
Today's usaco practice. This was definitely harder than I thought it would be, so it consumed most of my time. Learned quite a lot from the ~5 failed submissions and draft algorithms though.
I could only do one problem for USACO silver. I'll practice more for next time, as the problems were very difficult.
Today I learned about Monte Carlo simulations. Here are my notes for my project relating to them:
Today I learned about binary lifting and Lowest Common Ancestors.
Made a buggy release in my AI project to begin implementing epochs.
Github: github.com/minglangdu/AI-test
No video this time since its too buggy to deserve one.
BTW this is not committed, you shouldn't see it on Github.
Added a little debug window to my neural network test. It is going to help me fix many issues! youtu.be/k6WEUDrnXCc?t=8
Edit: added an image to placate scrappy
As of now in USACO, I have full points on problem 1 and 2 and partial on problem 3. It's my top score of all time and I'm really excited!
first time trying this new flowmodoro technique
First doubloons
First hour of many
Github: github.com/guywithnousername/wfctest
I realized my algorithm wasn't updating the procedural generation after some time, so I spent some time documenting the code to understand it more. Hopefully this will help me find the problem.
Here is the debugging (red means not filled in, and the all different possibilities for each square are in the brackets):
Practicing coding a lot today on no particular website because I'm registering for CALICO. I've never coded in a team, so I'll see how this goes. The website doesn't have a thumbnail so:
No coding today but I just started using the pomodoro technique
Was able to get the IDE to connect to my programmer after some help from #C015HANFLE5| and someone at an open house. Thanks
I just got my arduinos I bought for my science fair experiment!
Just finished my high school admissions interview! I showed them this website I made way back then:
After so many months, I'm finally returning to my procedural generation project! This scrapbook feature has really helped me pick up my old projects again, after I run out of ideas.
Github: github.com/guywithnousername/wfctest/tree/stitch