Welcome to EGSoftWeb

The N Queens Problem is the problem of placing N chess queens on an N×N chessboard so that no two queens threaten each other. Thus, a solution requires that no two queens share the same row, column, or diagonal. The eight queens puzzle is an example of the N queens problem of placing N non-attacking queens on an N×N chessboard, for which solutions exist for all natural numbers N with the exception of N=2 and N=3. In the code, backtracking method is used to solve the problem. A queen is placed in a column that is known not to cause conflict. If a column is not found the program returns to the last good state and then tries a different column by incrementing or decrementing the column index.

A random password generator is software program or hardware device that takes input from a random or pseudo-random number generator and automatically generates a password. Random passwords can be generated manually, using simple sources of randomness such as dice or coins, or they can be generated using a computer software program. Here we have a simple program by using it you can generate a strong password of any predefined length. As you increase the length of password, it becomes stronger.

Here we demonstrate how can we show the star (*) for an input password. It may be used when we are developing an application that has a login form in which we use a user name and password as logging information. For security purpose it is needed to show (*) instead showing the plain text for the password. The source code is given below to show how we can do it using c.

String manipulation is the action of the fundamental operations on strings, including their creation, concatenation, the extraction of string segments, string matching, their comparison, discovering their length, replacing substrings by other strings. Here we demonstrate some example of string manipulation.

A recursive function is a function which either calls itself or is in a potential cycle of function calls. Here some simple examples of recursive functions are given like factorial of a number, Fibonacci number series, combination, permutation & tower of Hanoi.

This code demonstrates simple functions of patterns that are useful for beginner in C/C++ coding. A namespace `Pattern` is defined to access all pattern functions so that they can be used in one main function. The code is simple enough and can be understood if you know the basic `for loop`.

A Magic Square of order N is an arrangement of N x N numbers, usually distinct integers, in a square, such that the n numbers in all rows, all columns, and both diagonals sum to the same constant. A magic square contains the integers from 1 to N x N. The constant sum in every row, column and diagonal is called the magic constant or magic sum, M. The Magic Constant of a normal magic square depends only on n and has the following value: M = N(N^2+1)/2; Here we demonstrate a program to draw magic-square for order of an odd number. You can change the value of N in the code to print for a different number.

This code prints all prime factors of a specified number in both multiplication and power form. There are two separate functions to print in different forms. The explanation of code is given in the code in comments. The code may be improved for large integers and performance.

This C++ program demonstrates the Sudoku problem solver using Backtracking Method. We basically check that the same number is not present in current row, current column and current 3X3 sub grid. After checking for safety, we assign the number and recursively check whether this assignment leads to a solution or not. If the assignment does not lead to a solution, then we try next number for current empty cell and if none of number lead to solution we return false.