New Casio fx-9860 GIII model

[grsbanks]

(10-05-2020 12:25 PM)toml_12953 Wrote:  Would you post the exact program you used to test? For a valid benchmark, the same program should be used on all the tested calculators (or as close as possible). Here's the nqueens program I used:

Sure. FWIW I think yours stops at the first solution found. Mine starts by asking what size board you want to work with and then finds all the solutions (92 in the case of an 8×8 board)

Code:

n=0
while n<1 or n>10:
    n = int(input("n= (1 to 10) "))

sol = [ 0 ] * n

nodes=0
solutions=0
row=0
col=0

# Keep on doing this until we try and go "back" beyond the first row
while row >= 0:
    
    # Keep on while we're in the range 0..n-1 for the column
    while col < n:
    
        # increment the count of nodes examined
        nodes += 1

        # Find out if this space is safe.
        safe=True
        if row > 0:
            for testrow in range(row):
                # If there's something in the same column or on the same diagonal then we're not safe
                if sol[testrow]==col or abs(sol[testrow]-col)==(row-testrow):
                    safe=False
                    break
        
        if safe:
            # Mark the space as taken
            sol[row] = col
            # Are we on the final row?
            if row==(n-1):
                # Yes, then we have a solution
                solutions += 1;
                # print(sol)
            else:
                # If not then try solving as of col 0 in the next row
                col=0;
                row += 1
                continue
                
        # move to the next column
        col += 1
        
        # end while col < n

    # Nothing more in this column so we need to go back to the previous row
    row -= 1;
    # ...and try on the next column
    if row >= 0:
        col=sol[row]+1
    
    #end while row >= 0

print()
print(n,"×",n," board")
print(solutions, "solutions")
print(nodes, "nodes tested")