thomasnield

Solving the world's hardest Sudoku (according to the Telegraph) using a branch-and-bound algorithm. https://www.telegraph.co.uk/news/science/science-news/9359579/Worlds-hardest-sudoku-can-you-crack-it.html Learn more about the algorithm in my other video: https://www.youtube.com/watch?v=F6RiAN1A8n0 GitHub source code can for the application can be found here: https://www.youtube.com/redirect?q=https%3A%2F%2Fgithub.com%2Fthomasnield%2Fkotlin-sudoku-solver&redir_token=e_toTvvMeU_zybEKgz2MaNuyd9B8MTUzNjUzMTQxMEAxNTM2NDQ1MDEw&v=F6RiAN1A8n0&event=video_description

Manual: https://www.digitalcombatsimulator.com/en/downloads/documentation/dcs-p-51d_flight_manual_en/ Chuck's Guide: https://www.mudspike.com/chucks-guides-dcs-p-51d-mustang-guide/

A walkthrough showing how to solve a Sudoku with an algorithm written from scratch (using Kotlin). ERRATA: I loosely refer to the "Branch-and-Prune" algorithm as "Branch-and-Bound" at times in this presentation. This technically is not correct as I'm not doing any linear relaxation that occurs in optimization variants of state space search problems. I'm simply pruning branches that do not meet constraints. The branch-and-prune/branch-and-bound algorithm can be enormously useful not just for solving Sudokus, but also real-world problems like scheduling (staff, classrooms, server jobs, transportation) and the knapsack problem. GitHub source code can be found here: https://github.com/thomasnield/kotlin-sudoku-solver Here is an example that generates a classroom schedule: https://github.com/thomasnield/optimized-scheduling-demo If you want to learn more about discrete optimization, I highly recommend this class on Coursera: https://www.coursera.org/learn/discrete-optimization/home/welcome

This is a walkthrough of the Traveling Salesman Problem, with an animated algorithm demonstration using Kotlin and JavaFX/TornadoFX. Source code for this application can be found here: https://github.com/thomasnield/traveling_salesman_demo Also check out my Traveling Salesman Plotter tool to select and tour points. https://github.com/thomasnield/traveling_salesman_plotter. If you want to learn more about Discrete Optimization, I highly recommend this excellent Coursera class. https://www.coursera.org/learn/discrete-optimization

Taking the DJI Tello on a test drive using a Python interface. Python Code: https://gist.github.com/thomasnield/dc5322b9f3d4fc49bf1d060a5e72797b DJI Tello Drone: https://www.amazon.com/Tello-Drone-Quadcopter-Batteries-Charger/dp/B07HLL7KFJ/

Election Fraud: Rudy Giuliani says he has uncovered enough unlawful ballots in Pennsylvania and Michigan to turn the election in favor of Trump.