Board coloring problem description, Programming Languages

Board Coloring

Problem Description

In this problem you are given a board in which some of the elements are placed as shown in diagram below. Each element represents a color.
Fill the other elements in the board, such that none of the adjacent elements (vertically, horizontally and diagonally) should be of the same color.
Find out the minimum number of colors that should be used to fill the blank spaces in the board, so that the above condition is met.
Color representation is -: 0, 1, 2, 3, 4, 5, 6, 7.........................
There is sample board:

641_board_coloring.png

            For Example:

Given Board :

821_board_coloring_1.png

Matrix representation of board is :
[ _ 1 _ _ ]
[ 2 _ _ _ ]
[ _ _ 2 _ ]
[ 2 _ _ _ ]
here blank space is represented by '_' .
Minimum colors to fill this board (given in the picture)is 4.

Instruction to work with Open PBT Client:

  1. Specify the work directory path in the 'Work directory Path' field. The path should correspond to your solution Work directory.
  2. Download the support files by clicking the Get Dev Files.
  3. You will find the problem directories containing:
    • problem.h file
    • problem.c file

in your project directory.

  1. Code the solution in.c file inside the problem directory
  2. All required files will be downloaded to your work directory. Creating additional files is strongly discouraged.

Step 1:

In your Solution File:

  • Implement your logic in function int color(char board[4][4])
  • char   board[4][4]board is 2 dimensional matrix of order M X M where M = 4.
  • You can create more functions if required, but those functions should be in the same file.

 

Step 2:

In your solution keep in mind the following constraints.

  1. In this problem you have to write a program that finds the minimum number of colors needed to fill a board in which some of the elements are placed in advance.
  2. Function color() will take 2 dimension board as a input.
  3. Function color() returns the minimum number of colors that could fill the board meeting the given condition.
  4. Board is a 2 dimensional of M X M where M = 4 else return 0
  5. Fill the other elements in the board, such that none of the adjacent elements (vertically, horizontally and diagonally) should be of the same color.

The Prototype of the function is

int color(char board[4][4])
This function takes following arguments.

  • board is 2 dimensional matrix of order M X M where M = 4.
  • This function returns minimum no of color by which board can be filled.

The constraints are:

  1. Board is a 2 dimensional of M X M where M = 4 else return 0
  2. Fill the other elements in the board, such that none of the adjacent elements (vertically, horizontally and diagonally) should be of the same color.

Example 1

Input


{ 2 0 _ 1 }
{ _ 1 _ _ }
{ _ 2 _ 0 }
{ _ _ _ 1 }

Output


5
Explanation:
We need a minimum 5 different colors to complete the board.

Example 2

Input


{ 2 0 _ 1 3}
{ _ 1 _ _ 2}
{ _ 2 _ 0 1}
{ _ _ _ 1 2}
{ _ _ _ _ 0}

Output


0


Explanation:
Size of the board is greater than 4X4.

Example 3

Input


{ _ 0 }
{ 1 _ }

Output


0


Explanation:
Size of the board is less than 4X4.

For C solutions

Header File

:

boardcoloring.h

Function Name

:

int color(char board1[4][4])

File Name

:

boardcoloring.c

For C++ solutions

Header File

:

boardcoloring.h

Class Name

:

BoardColoring

Function Name

:

int color(char board1[4][4])

File Name

:

boardcoloring.c

General Instructions

    *

The file / class names, functions, method signatures, header files are to be used as mentioned in the problem statement. Do not use your own names or change the method signatures and fields. You can add any number of additional methods.

    *

For C solutions, change the value of "C_OR_CPP" macro in header file as 1 and for C++ solutions change the value as 2.

    *

Incase of iostream.h specify as iostream only.

    *

Command line options for the main() function are not supported currently.

Posted Date: 9/2/2012 9:56:40 AM | Location : United States







Related Discussions:- Board coloring problem description, Assignment Help, Ask Question on Board coloring problem description, Get Answer, Expert's Help, Board coloring problem description Discussions

Write discussion on Board coloring problem description
Your posts are moderated
Related Questions
Dynamic Binding: - Binding refers to the linking of a procedure call to the code to be executed in response to the call. Dynamic binding (late binding) means that the code associa

Write a procedure named Str_concat that concatenates a source string to the end of a target string. Sufficient space must exist in the target string to accommodate the new characte

I need help with making a assembly program that uses Hoffman''s coding scheme to compress a text file.

Add macros to MS word 2010 according to A PARTICULAR FORMAT

Normal 0 false false false EN-US X-NONE X-NONE MicrosoftInternetExplorer4

Your solution to the problem should be housed within a while loop, which allows the grader to test your solution repeatedly without having to re-execute the script, as shown in cla

Write and test a simple perl program on the linux platform.  You may use any linux system you wish, including the Suse linux installed in the lab. Activities. Note:  to r

You need to create a Fraction calculator program.You need to create a Fraction class to represent fraction objects and a FractionCalculator class that will perform operations on fr

Each of the following two procedures defines a method for adding two positive integers in  terms of the procedures inc, which increments its argument by 1, and dec, which decrement