C#

amrreko wrote:

please i need the complation of 4 queen only by my code for my doctor

amrreko wrote:

please i need the complation of 4 queen

amrreko wrote:

only by my code for my doctor

amrreko wrote:

we start
desgin from
node class
bfs class
to top expirt

amrreko wrote:

please try to find by this method in simple code
by use my class and add to classes the miss code

Keith Barrow wrote:

amrreko wrote:
we start
desgin from
node class
bfs class
to top expirt

nice hiaku.

class Node
    {

        public bool[,] state { set; get; }//1
        public Node parent { set; get; }//2
        public List<Node> childs { get; set; }//3
        //6
        public int level { get; set; }
        public int Hfunction()//4
        {
        int res=0;
            return res;
        }
        public void generate_child()//5
        {
            for (int i = 0; i < 4; i++)
            {
               //creat copy of an object then do castting
                bool[,] newstate = (bool[,])this.state.Clone();//8
                Node child = new Node();//7
                childs.Add(child);//add to list
                child.parent = this;//declare to parent
                child.level = this.level + 1;
                newstate[child.level, i] = true;//9
                child.state = newstate;
            }
        
        
        }
        //10
        public bool visited { get; set; }
        public Node GetBestChild()//11
        {

            int Min = int.MaxValue;//max value  12
            int min_index = -1;//out side range of index
            Node BestChild = null;//declare null value for bestchild node
            for (int i = 0; i < 4;i++ )
            {
                int CurrentValue = this.childs[i].Hfunction();
                if (CurrentValue < Min && this.childs[i].visited == false)
                {
                    BestChild = this.childs[min_index];//14
                    BestChild.visited = true;

                    Min = CurrentValue;//13
                    min_index = i;//13

                }


            }
         return BestChild;
        }}

<pre>

amrreko wrote:

please i need the complation of 4 queen only by my code for my doctor

amrreko wrote:

we start

amrreko wrote:

desgin from

amrreko wrote:

node class

amrreko wrote:

bfs class

amrreko wrote:

to top expirt

amrreko wrote:

please try to find by this method in simple code

amrreko wrote:

by use my class and add to classes the miss code

class Node
    {

        public bool[,] state { set; get; }//1
        public Node parent { set; get; }//2
        public List<Node> childs { get; set; }//3
        //6
        public int level { get; set; }
        public int Hfunction()//4
        {
        int res=0;
            return res;
        }
        public void generate_child()//5
        {
            for (int i = 0; i < 4; i++)
            {
               //creat copy of an object then do castting
                bool[,] newstate = (bool[,])this.state.Clone();//8
                Node child = new Node();//7
                childs.Add(child);//add to list
                child.parent = this;//declare to parent
                child.level = this.level + 1;
                newstate[child.level, i] = true;//9
                child.state = newstate;
            }
        
        
        }
        //10
        public bool visited { get; set; }
        public Node GetBestChild()//11
        {

            int Min = int.MaxValue;//max value  12
            int min_index = -1;//out side range of index
            Node BestChild = null;//declare null value for bestchild node
            for (int i = 0; i < 4;i++ )
            {
                int CurrentValue = this.childs[i].Hfunction();
                if (CurrentValue < Min && this.childs[i].visited == false)
                {
                    BestChild = this.childs[min_index];//14
                    BestChild.visited = true;

                    Min = CurrentValue;//13
                    min_index = i;//13

                }


            }
         return BestChild;
        }

    }

class BFS
{
    public Node BfsProcess(Node root)
    {
        Node soultion = null;
        if (root.Hfunction() == 4)
        {

            return root;
        }
        else {
            root.generate_child();
            Node bestchild =null;
            while ((bestchild = root.GetBestChild()) != null)
            {
                soultion = BfsProcess(bestchild);

            }
                    return soultion;
        }

    }

}