{"id":128,"date":"2025-03-22T18:05:03","date_gmt":"2025-03-22T18:05:03","guid":{"rendered":"http:\/\/course.ece.cmu.edu\/~ece500\/projects\/s25-teamf1\/?p=128"},"modified":"2025-03-22T23:03:16","modified_gmt":"2025-03-22T23:03:16","slug":"samuel-telanoff-status-report-3-22-25","status":"publish","type":"post","link":"http:\/\/course.ece.cmu.edu\/~ece500\/projects\/s25-teamf1\/2025\/03\/22\/samuel-telanoff-status-report-3-22-25\/","title":{"rendered":"Samuel Telanoff Status Report 3\/22\/25"},"content":{"rendered":"

This week I spent my time working on the find_best_shot algorithm for the physics simulation portion of our project. Currently, my approach is good and finds the 9-ball shot that: a) hits the lowest numbered ball on the table, b) does not result in a scratch, c) pots 1+ balls, d) sets up the cue ball to be closest to the lowest numbered ball on the table, and e) occasionally pots the 9 ball if possible.<\/p>\n

However, I am still using more of a brute-force approach than a greedy one. I am thinking of ways to use some Simulated Annealing to find the optimal shot we can take. This will require tweaking parameters that determine the “score” of a shot — this includes balls potted, where the cue ball ends up, etc. I will be spending my time this upcoming week implementing my algorithm and optimizing it to complete in under four seconds as specified by our use-case requirements.<\/p>\n

I am still on schedule and, again, hope to be done with the best shot algorithm + display mapping before carnival so that we can test MVP.<\/p>\n

\"\" \"\" \"\"<\/p>\n","protected":false},"excerpt":{"rendered":"

This week I spent my time working on the find_best_shot algorithm for the physics simulation portion of our project. Currently, my approach is good and finds the 9-ball shot that: a) hits the lowest numbered ball on the table, b) does not result in a scratch, c) pots 1+ balls, d) sets up the cue … <\/p>\n

Continue reading “Samuel Telanoff Status Report 3\/22\/25”<\/span><\/a><\/p>\n","protected":false},"author":1130,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[1],"tags":[],"_links":{"self":[{"href":"http:\/\/course.ece.cmu.edu\/~ece500\/projects\/s25-teamf1\/wp-json\/wp\/v2\/posts\/128"}],"collection":[{"href":"http:\/\/course.ece.cmu.edu\/~ece500\/projects\/s25-teamf1\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/course.ece.cmu.edu\/~ece500\/projects\/s25-teamf1\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/course.ece.cmu.edu\/~ece500\/projects\/s25-teamf1\/wp-json\/wp\/v2\/users\/1130"}],"replies":[{"embeddable":true,"href":"http:\/\/course.ece.cmu.edu\/~ece500\/projects\/s25-teamf1\/wp-json\/wp\/v2\/comments?post=128"}],"version-history":[{"count":3,"href":"http:\/\/course.ece.cmu.edu\/~ece500\/projects\/s25-teamf1\/wp-json\/wp\/v2\/posts\/128\/revisions"}],"predecessor-version":[{"id":134,"href":"http:\/\/course.ece.cmu.edu\/~ece500\/projects\/s25-teamf1\/wp-json\/wp\/v2\/posts\/128\/revisions\/134"}],"wp:attachment":[{"href":"http:\/\/course.ece.cmu.edu\/~ece500\/projects\/s25-teamf1\/wp-json\/wp\/v2\/media?parent=128"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/course.ece.cmu.edu\/~ece500\/projects\/s25-teamf1\/wp-json\/wp\/v2\/categories?post=128"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/course.ece.cmu.edu\/~ece500\/projects\/s25-teamf1\/wp-json\/wp\/v2\/tags?post=128"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}