Programming

Covered Area Problem

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

By | 2014-08-30T15:30:33+00:00 28 Jun 2005|Programming|0 Comments

Window Region

I got some incoming questions asking about how I created the heart-shaped application in Visi True Love 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 rgnHati:

By | 2014-08-29T21:50:13+00:00 18 Sep 2000|Programming|0 Comments

N-Queen Problem (2)

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

By | 2014-08-29T21:45:19+00:00 27 Jun 2000|Programming|0 Comments

N-Queen Problem

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

By | 2014-08-29T21:44:16+00:00 19 Jun 2000|Programming|0 Comments