Scribd Logo
Upload

Welcome to Scribd!

  • 4 Solutia Este: Varianta Pascal

    Uploaded by

    Victor Motruc
    7 views2 pages
    This document contains code written in Pascal to generate and output all possible solutions to the N-queens problem on an N x N chessboard where no two queens can attack each other. The code uses backtracking recursion to place queens on the board one column at a time and check for valid placements without conflicts. It outputs the number of total solutions found.

    Original Description:

    program pascal- problema cu regina

    Original Title

    Regina

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document contains code written in Pascal to generate and output all possible solutions to the N-queens problem on an N x N chessboard where no two queens can attack each other. The code uses backtracking recursion to place queens on the board one column at a time and check for valid placements without conflicts. It outputs the number of total solutions found.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    7 views2 pages

    4 Solutia Este: Varianta Pascal

    Uploaded by

    Victor Motruc
    This document contains code written in Pascal to generate and output all possible solutions to the N-queens problem on an N x N chessboard where no two queens can attack each other. The code uses backtracking recursion to place queens on the board one column at a time and check for valid placements without conflicts. It outputs the number of total solutions found.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 2

    4

    Solutia este

    OOXO
    XOOO
    OOOX
    O X O O Solutia a2este

    OXOO
    OOOX
    XOOO
    OOXO
    2solutii

    Varianta Pascal
    var x:array[1..100] of byte;
    n:byte;
    nrsol:word;
    procedure scriesol;
    var i,j:byte;
    begin
    inc(nrsol);
    writeln('Solutia a',nrsol,'este');
    for i:=1 to n do begin
    writeln;
    for j:=1 to n do
    if x[j]=i then
    write('X','
    ')
    else
    write('O',' ');
    end;
    end;
    function potcont(k:byte):boolean;
    var i:byte;
    atac:boolean;
    begin
    atac:=false;
    for i:=1 to k-1 do
    if(x[i]=x[k]) or (k-i=abs(x[k]-x[i]))
    then atac:=true;

    potcont:=not atac;
    end;
    procedure back(k:byte);
    var i:byte;
    begin
    for i:=1 to n do
    begin
    x[k]:=i;
    if potcont(k) then
    if k=n then scriesol
    else back(k+1);
    end;
    end;
    begin
    read(n);
    nrsol:=0;
    back(1);
    writeln(nrsol,'solutii');
    end.

    You might also like