Creation of the chips placement game with backtracking method in Borland Pascal

This paper presents the creation of the chips placement game with backtracking method in Borland Pascal. The chips placement is done on a chess table, where you can place a number of four to eight chips on a 4×4 to 8×8 chess table. The goal is to place each chip that to be the single chip on that row and column and to place all the chips at a time. The goal of the game is to compute all the combinations that can be done for the placement of the chips. This method can be easily calculated with the backtracking method. Backtracking method can compute all the combinations with a very short code.