In this article, we are going to explore the problem of Zero-One Knapsack and solve it using a heuristic approach. Let us imagine that we are in a dystopian future, the machines are programming themselves, programmers are now outside of Jevons Paradox, we can no longer count on good salaries…

In this article, we aim to create an intelligent program capable of playing the game of Tetris. The main feature of this project that makes it unique from all the other existing similar projects, is its ability to use the advantage that humans have against computers with respect to the…

This article is a continuation of the Augmented Reality Sudoku Solver, we are going to build a GUI-based AR Sudoku Solver. In this article, we are going to build the GUI components of the project using PyGame. …

This article is a continuation of the Augmented Reality Sudoku Solver, we are going to build a GUI-based AR Sudoku Solver. In this article, we understand how to extract numbers from the processed image of the puzzle. …

This article is a continuation of the Augmented Reality Sudoku Solver, we are going to build a GUI-based AR Sudoku Solver. In this article, we talk about the image processing pipeline of the project and how to implement our approach in Python using OpenCV. …

In this article, we are going to learn about Web Application Security and OWASP’s top 10 web application security risks. What is Web Application Security? Web Application Security includes the methods and techniques used to make any form of Web Application on a network, Secure and Safe from intentional and unintentional damages. What Are Application Security Risks? Attackers can potentially…

This article is the fourth and final part of my article series on Genetic Algorithms to solve the Zero-One Knapsack Problem. The First article introduces us to Genetic Algorithms in general and how they are applicable to the Zero-One Knapsack Problem. The Second article then takes us through the implementation of…

This article is the third part of my previous article: Genetic Algorithms to solve the Zero-One Knapsack Problem. Please read that article before proceeding with this article to better understand the concept. …

This article is the second part of my previous article: Genetic Algorithms to solve the Zero-One Knapsack Problem. Please read that article before proceeding with this article to better understand the concept. Summary: The primary objective of the problem is to fill a knapsack of fixed capacity with the most…