• Member Avatar
    ubhart

    Replied To a Post in 12 knights (chess) to dominate all squares

    @rubberman , you mean like this: #include <stdio.h> #include <stdlib.h> #include <stdbool.h> //(*******************************************************************************) void addNulls(char L[][9], int N[], int M[]) { int i,j,g; for (i=1 ; i<9 ; i++) { …
  • Member Avatar
    ubhart

    Created 12 knights (chess) to dominate all squares

    Hi, I am making program that finds solution how to put 12 knights(horses) to chess board that every square is dominated or engaged by other knight. Look at my code: …
  • Member Avatar
    ubhart

    Began Watching 12 knights (chess) to dominate all squares

    Hi, I am making program that finds solution how to put 12 knights(horses) to chess board that every square is dominated or engaged by other knight. Look at my code: …
  • Member Avatar
    ubhart

    Replied To a Post in 12 knights to dominate all squares of chess board 8x8

    Here is what i have so far: #include <stdio.h> #include <stdlib.h> #include <stdbool.h> //(*******************************************************************************) void addNulls(char L[][9], int N[], int M[]) { int i,j,g; for (i=1 ; i<9 ; i++) …
  • Member Avatar
    ubhart

    Created 12 knights to dominate all squares of chess board 8x8

    Hi I have to write program that finds a solution how to put 12 knights to a 8x8 chess board that every square would be dominated by one of the …
  • Member Avatar
    ubhart

    Began Watching 12 knights to dominate all squares of chess board 8x8

    Hi I have to write program that finds a solution how to put 12 knights to a 8x8 chess board that every square would be dominated by one of the …
  • Member Avatar
    ubhart

    Replied To a Post in Adding elements to linked list in correct order (ADT Priority Que) problem.

    Thanks for your post, I know that it's hard to read code without all program. I found the mistake: It should be while(tempas->fr!=NULL && tempas->fr->priority<=prrt) tempas=tempas->fr; And not: while(tempas->fr**->prv**!=NULL && …
  • Member Avatar
    ubhart

    Created Adding elements to linked list in correct order (ADT Priority Que) problem.

    I am implementing Priority QUE as a doubly linked list. My structs: typedef int kintyr; typedef struct qElem { struct qElem *prv; kintyr *dat; int *priority; }qElem; typedef struct que …
  • Member Avatar
    ubhart

    Began Watching Adding elements to linked list in correct order (ADT Priority Que) problem.

    I am implementing Priority QUE as a doubly linked list. My structs: typedef int kintyr; typedef struct qElem { struct qElem *prv; kintyr *dat; int *priority; }qElem; typedef struct que …

The End.