This is part of the course lesson of our course with the same name. Go back to the course via this link. In this project, I will show you how I have built a simple but quite powerful movie recommendation app. 💻 Try It Yourself: You can play with the live demo here. I built …
ChatGPT at the Heart – Building a Movie Recommendation Python Web App in 2023 Read More »
This is part of our full academy course with video Project Description Both in my day job and personal life, I notice every day how important online security has become. Almost every part of our everyday lives are connected somehow to the Internet. And everyone of those connections requires (or should need) a password at …
Finxter Project – Streamlit Password Generator App Read More »
Summary: To create an interactive web application in a Jupyter Notebook, use the three libraries ipywidgets, voila, and binder. This requires only basic Python programming skills without the need to learn a new framework. There are various Python tools available to create web applications and frontend GUIs. For example, Flask and Django. As useful as …
How to Create an Interactive Web Application using a Jupyter Notebook Read More »
You can check out the slides here (direct PDF link): What is Backtracking? Backtracking is a general approach, i.e. a variant of a depth-first search algorithm, suited for solving constraint satisfaction problems. ???? Idea: Backtracking incrementally validates candidates, tests the solutions, and backtracks from a candidate value if it determines that the final solution is …
As you watch the video, you can have a look at the slides as PDF: download slides in a new tab here. What is the Jump Point Search Algorithm? The jump point search algorithm — or shorter JPS — is a variant of the A* search algorithm, optimized for pathfinding on grid maps, i.e., in …
This tutorial guides you into the fascinating A* (A-Star) using the Python programming language. First, feel free to watch the video guide—we’ll give a detailed textual explanation below. The slides can be found as a Gif here: Okay, so let’s dive into the algorithm motivation, explanation, and Python code next! What is the A* Search …
You can download the PDF file of the presentation here. Also, watch the presentation as a Gif here: What is Dijkstra’s Algorithm? Dijkstra’s algorithm solves the single-source shortest path (SSSP) problem. Generally, it enables finding the shortest route between two vertices in a graph. Its author is dr. Edsger W. Dijkstra, a pioneering contributor to …
You can watch the slides as a GIF here: And download the slides as PDF here. What’s the Best-First Search Algorithm? After several articles on uninformed search algorithms, we continue our journey to informed search algorithms. The first one in the series is the Best-First search algorithm. In general, informed search algorithms use some kind …
What is an Iterative Deepening Depth-First Search Algorithm? Continuing our story even further, after introducing graphs and basic graph traversal algorithms, we will refine the Depth-First Search Algorithm by introducing the iterative depth limitation. An iterative deepening depth-search algorithm also traverses a graph by exploring it vertex-by-vertex, but it does it by following the vertical …
Python Iterative Deepening Depth-First Search (DFS) Algorithm Read More »
What is a Depth-First Search (DFS) Algorithm? Building on our previous story about graphs and graph traversal algorithms, this time we will look into a depth-first search algorithm. A depth-search algorithm also traverses a graph by exploring it vertex-by-vertex, but it does it by following the vertical order of the vertices. Although the depth-first search …
