CASIO Graph 90+E

[Dave Britten]

(09-01-2018 10:40 AM)xerxes Wrote:  

(08-30-2018 03:54 PM)Dave Britten Wrote:  EDIT: It can run the standard 8x8 n-queens benchmark (http://www.hpmuseum.org/cgi-sys/cgiwrap/...i?read=700) in a bit under one second. (I just did a quick port of the generic Pascal version on that page.)

Would be nice to have your test result and the code in the list, if you are also interested.
If yes, can you please check the execution time with an outer loop of 100 iterations for a
more accurate result?

100 runs took a total of about 29 seconds. The code is listed below; should work for just about anything that runs Python.

Code:

for i in range(100):
  a = [0] * 9
  r = 8
  s = 0
  x = 0
  y = 0
  t = 0
  while True:
    x += 1
    a[x] = r
    while True:
      s += 1
      y = x
      while y>1:
        y -= 1
        t = a[x]-a[y]
        if t==0 or x-y==abs(t):
          y=0
          a[x] -= 1
          while a[x]==0:
            x -= 1
            a[x] -= 1
      if y==1:
        break;
    if x==r:
      break;
  print(s)