One of the simplest methods to generate all possible permutations of N items is Heap's algorithm. This algorithm was proposed by B. R. Heap in 1963, and remains popular until today due to its simplicity. I came across the need to generate permutations for a
This morning I attended an event called "Developer Direct LIVE" from Embarcadero Technologies, the maker of RAD Studio XE6 (contains Delphi XE6 and C++Builder XE6). RAD Studio XE6 is currently the only development tool capable to compile applications in 4 different operating systems: Windows, Mac
Covered area problem is a geometry problem represented in Cartesian product. Many rectangles are located in a two dimensional environment. Each rectangle has its upper-left coordinate and lower-right coordinate to indicate its position. One rectangle can be placed separated from other rectangles, can be placed
I got some incoming questions asking about how I created the heart-shaped application in VTL v2.5. So, here's the source code to make it happen. First, put this code in your OnCreate event of your main form : procedure TForm1.FormCreate(Sender: TObject); var rgnHeart: HRGN; begin
N Queen problem is a classic constraint satisfaction problem based on chess game. The idea is how to put N numbers of Queen in N x N chessboard without giving them any chance to kill each other in one turn. This post is a continuation
N Queen problem is a classic constraint satisfaction problem based on chess game. The idea is how to put N numbers of Queen in N x N chessboard without giving them any chance to kill each other in one turn. This article is specially dedicated