Show Posts

This section allows you to view all posts made by this member. Note that you can only see posts made in areas you currently have access to.


Messages - Richard Frost

Pages: 1 2 [3] 4 5 ... 22
31
QB64 Discussion / Re: Forum outages
« on: December 06, 2021, 06:13:57 pm »
I use branchless programming a lot in critical sections of my chess program where the ultimate in speed is required. 
The problem with it is that it makes the code very, very ugly and hard to understand later.

Another way to get more speed is to avoid using strings.  Cut the strings and SET THE PUPPETS FREE!

32
Programs / Re: 🐠 Curious Fish
« on: December 02, 2021, 03:06:47 pm »
Cute.  Should have Don Ho's "Tiny Bubbles" playing in the background.

33
QB64 Discussion / Re: What's your digital signature look like?
« on: December 01, 2021, 02:54:17 pm »
What a unique idea! 

I want tuna, I want liver, I want chicken, please deliver.

34
QB64 Discussion / Re: Hey Jude
« on: November 24, 2021, 10:36:54 pm »
Code: QB64: [Select]
  2.     Print "Number 9....";
  5.  

35
QB64 Discussion / Re: QB64 Certification
« on: November 20, 2021, 07:09:00 pm »
Design and print your own certificate.  It should contain a picture of a dodo bird or Chia Pet.

Mine has this:

36
Programs / Re: Contour Plot
« on: November 20, 2021, 03:54:19 pm »
I've wanted code to do that for over 20 years.  I did ONE hill in a sad, 2D fashion.

Lovely stuff, slightly marred by using FONT 8, so I modified your code to use Liberati 9.

My feeble attempt:

Code: QB64: [Select]
  1. Dim distance(360), elevation(360), active(20), angle(20)
  2. Screen _NewImage(800, 600, 12)
  3. xc = _Width \ 2: yc = _Height \ 2
  4. asp! = yc / xc
  7.  
  9.     Cls
  10.     mind = 9999: maxd = -mind
  11.     mine = 9999: maxe = -mine
  12.  
  13.     distance(0) = 0
  14.     e0 = 300 + Rnd * 20
  15.     active(0) = 360
  16.     elevation(0) = e0
  17.     elevation(360) = e0
  18.     maxe = e0
  19.  
  20.     n = 8
  21.     genang:
  22.     For i = 1 To n
  23.         angle(i) = Rnd * 360
  24.     Next i
  25.     sort:
  26.     sorted = 1
  27.     For i = 1 To n - 1
  28.         If angle(i) > angle(i + 1) Then sorted = 0: Swap angle(i), angle(i + 1)
  29.     Next i
  30.     If sorted = 0 Then GoTo sort
  31.     For i = 1 To n - 1
  32.         If (angle(i + 1) - angle(i)) < 20 Then GoTo genang
  33.     Next i
  34.  
  35.     For i = 1 To n
  36.         angle = angle(i)
  37.         angle = (angle + 360) Mod 360
  38.         active(i) = angle Mod 360
  39.         distance = 50 + Rnd * 250
  40.         elevation = 100 + Rnd * 150
  41.         If distance > maxd Then maxd = distance
  42.         If distance < mind Then mind = distance
  43.         If elevation > maxe Then maxe = elevation
  44.         If elevation < mine Then mine = elevation
  45.         distance(angle) = distance
  46.         elevation(angle) = elevation
  47.     Next i
  48.     xm = xc / (maxd - mind)
  49.     ym = yc / (maxd - mind)
  50.     active(n + 1) = active(1) '                            repeat 1st coord
  51.     distance(active(n + 1)) = distance(active(1))
  52.     elevation(active(n + 1)) = elevation(active(1))
  53.  
  54.     For i = 1 To n + 1 '                                   approx missing data each degree
  55.         angle1 = active(i - 1)
  56.         angle2 = active(i)
  57.         ddif = distance(angle2) - distance(angle1)
  58.         edif = elevation(angle2) - elevation(angle1)
  59.         If i = (n + 1) Then angle2 = angle2 + 360
  60.         a = 0: ai = 90 / (angle2 - angle1) '               angle, angle increment
  61.         For z = Int(angle1) To angle2
  62.             na = z Mod 360 '                               ensure array bounds not exceeded
  63.             q = Sin(_D2R(a))
  64.             q = q * q '                                    smoothing
  65.             a = a + ai
  66.             distance(na) = distance(angle1) + ddif * q
  67.             elevation(na) = elevation(angle1) + edif * q
  68.         Next z
  69.     Next i
  70.     EndinEl = Int(maxe / q) * q
  71.     For el = -300 To EndinEl Step 5
  72.         col = 1
  73.         If (el Mod 20) = 0 Then col = 9
  74.         If (el Mod 40) = 0 Then col = 4
  75.         pf = 0 '                                           plot flag (move/draw)
  76.         For mangle = 0 To 360
  77.             angle = mangle Mod 360
  78.             distance = distance(angle)
  79.             elevation = elevation(angle)
  80.             epf = distance / (e0 - elevation)
  81.             d = distance - ((el - elevation) * epf)
  82.             x = xc + d * xm * Cos(_D2R(angle)) * asp!
  83.             y = yc - d * ym * Sin(_D2R(angle))
  84.             If pf = 1 Then Line -(x, y), col Else pf = 1: PSet (x, y), col
  85.         Next mangle
  86.     Next el
  87.  
  88.     For i = 0 To n
  89.         d = 0: e = e0
  90.         If i Then d = distance(i): e = elevation(angle(i))
  91.         x = xc + d * Cos(_D2R(angle(i))) * asp!
  92.         y = yc - d * Sin(_D2R(angle(i)))
  93.         Circle (x, y), 1, 15
  94.         _PrintString (x, y + 5), Str$(Int(e))
  95.     Next i
  96.     Sleep
  99.  

37
Programs / Re: Even Better Stars
« on: November 18, 2021, 07:05:37 pm »
It's what Dave would have seen in 2001 if Kubrick wasn't so much into realism - Dave
after a lollipop overdose.   The animation would fit well into The Big Lebowski too.  Super pretty.





38
QB64 Discussion / Re: Trying to join the QB64 on Linux crowd. Error installing QB64. Need advice.
« on: November 18, 2021, 11:40:48 am »
I recommend my chess program as an example of accommodating Windows or Linux Mint -
the version in the Forums, not the outdated one in Games.

1) As I need to rename,delete, and edit files (saved games), I've defined variables
   for these commands and assign them in an "$IF WIN" block.  In the same block I
   also set a variable called minty to true for Linux, for later use.

2) Windows libraries don't work with Linux.  SMcNeill's getCPUload function is for
   Windows.  Under Linux I use the sensors command instead.

3) Linux really cares about file case.  For chess I've made all resource files
   lowercase, but can handle a user renaming a log file using upper or mixed case.

4) Linux uses / in pathnames.  Windows uses \ in pathnames.  So create a constant or
   variable called "slash".

5) Filename dates are a little different in Mint.  The year is not shown unless the
   file is older than 6 months.  Keep that in mind if you read directories and need
   that info.

6) I haven't gotten icons to work at all, with $EXEICON or _ICON.

I'm pretty new to Linux Mint too, having been given a machine containing it about 2
months ago and only working on getting my chess program fully compatible with it
for the past week.

There are likely a lot of other differences a compatible program should handle.  The
above are the problems I've had so far.

39
Programs / Re: Chess
« on: November 17, 2021, 09:07:03 pm »
Update:

1) full Linux compatibility (all files lowercase and uses sensors for temperature)
2) better throttling
3) nicer appearance
4) 3 clocks to choose from
5) blessed by a garden gnome in Walla Walla Washington

6) "Style" button to sequence thru 12 styles (colors, sets, clock type, etc)


40
Programs / Re: Ascii Plasma!
« on: November 11, 2021, 06:29:12 am »
Very impressive!

Now train 12,000 monkeys to hold up placards to accomplish the same.

41
Programs / Re: CLOCK.BAS
« on: November 08, 2021, 06:09:00 pm »
Ran yours - always nice to see unique clocks.  Since you mentioned the airport type:
 
Code: QB64: [Select]
  1. _Title " World Clock"
  3. Dim p$(30), zo(30), t$(30) '                     place, zone, time
  4. Screen _NewImage(800, 600, 32)
  6. For i = 1 To 30: Read p$(i), zo(i): Next i
  7. d = 35 '                                         diameter of clocks
  9.     Cls: t$ = Time$
  10.     h = (Val(Mid$(t$, 1, 2)) + 7) Mod 24 '       GMT = my time + 7
  11.     m = Val(Mid$(t$, 4, 2))
  12.     For i = 1 To 30 '                            actual time for each place
  13.         th = h + Int(zo(i))
  14.         z! = Abs(zo(i)) - Abs(Int(zo(i)))
  15.         tm = m + z! * 60 * Sgn(zo(i))
  16.         If tm < Val("00") Then tm = tm + 60: th = th - 1
  17.         If tm > Val("59") Then tm = tm - 60: th = th + 1
  18.         th = (th + 24) Mod 24
  19.         th$ = Right$("0" + LTrim$(Str$(th)), 2)
  20.         tm$ = Right$("0" + LTrim$(Str$(tm)), 2)
  21.         t$(i) = th$ + tm$
  22.     Next i
  23.     p = 0 '                                      place index
  24.     For yi = 0 To 4
  25.         For xi = 0 To 5
  26.             xc = xi * _Width \ 6 + (_Width \ 6) * .5
  27.             yc = yi * _Height / 5.4 + 60
  28.             p = p + 1 '                          place index
  29.             _PrintString (xc - _PrintWidth(p$(p)) \ 2, yc + d + 4), p$(p)
  30.             Circle (xc, yc), d + 2, Green
  31.             If Val(Left$(t$(p), 2)) < 12 Then Paint (xc, yc), Green, Green ' am/pm
  32.             For a = 0 To 330 Step 30 '           clock tick marks
  33.                 x1 = xc + (d - 3) * Cos(_D2R(a))
  34.                 y1 = yc + (d - 3) * Sin(_D2R(a))
  35.                 Circle (x1, y1), 1, White '      ticks
  36.             Next a
  37.             th = Val(Mid$(t$(p), 1, 2)) '        hour
  38.             tm = Val(Mid$(t$(p), 3, 2)) '        minute
  39.             ra = _D2R(tm * 6 - 90) '             minute hand
  40.             x(0) = xc + (d - 8) * Cos(ra)
  41.             y(0) = yc + (d - 8) * Sin(ra)
  42.             ra = _D2R((th + tm / 60) * 30 - 90) 'hour hand
  43.             x(1) = xc + (d - 16) * Cos(ra)
  44.             y(1) = yc + (d - 16) * Sin(ra)
  45.             For zz = 0 To 1 '                    draw hands
  46.                 For zx = -1 To 1
  47.                     For zy = -1 To 1
  48.                         Line (xc + zx, yc + zy)-(x(zz), y(zz)), White
  49.                     Next zy
  50.                 Next zx
  51.             Next zz
  52.         Next xi
  53.     Next yi
  54.     Do: _Limit 10 '                              wait for new minute
  55.         x = 20 + Val(Right$(Time$, 2)) / 60 * (_Width - 40)
  56.         Line (20, _Height - 20)-(x, _Height - 21), Green, B
  57.         _Display
  58.         If Len(InKey$) Then System '             any key exits
  59.     Loop Until Left$(t$, 5) <> Left$(Time$, 5)
  61.  
  62. Data Amsterdam,1
  63. Data Beijing,8
  64. Data Berlin,1
  65. Data Brasilia,-3
  66. Data Cairo,2
  67. Data Chicago,-6
  68. Data Delhi,5.5
  69. Data Denver,-7
  70. Data Detroit,-5
  71. Data Edmonton,-7
  72. Data Gander,-3.5
  73. Data Hawaii,-10
  74. Data Hong Kong,8
  75. Data Houston,-6
  76. Data Istanbul,2
  77. Data London,0
  78. Data Los Angeles,-9
  79. Data Madrid,1
  80. Data Mexico City,-6
  81. Data Moscow,3
  82. Data New York,-5
  83. Data Paris,1
  84. Data Perth,8
  85. Data Phoenix,-8
  86. Data Rome,1
  87. Data Seoul,9
  88. Data Singapore,8
  89. Data Sydney,10
  90. Data Tehran,3.5
  91. Data Tokyo,9
  92.  

42
QB64 Discussion / Re: Use TIME$ to calculate elapsed time to tenth of a second?
« on: September 28, 2021, 12:58:39 am »
Steve's extendedtimer function is the ultimate solution, but overkill for most situations.   An easier way to deal with crossing midnite is:


Code: QB64: [Select]
  1. start! = Timer
  2. Do: _Limit 100 '                                       _LIMIT helps prevent CPU overload
  3.     elapsed! = Timer - start!
  4.     If elapsed! < 0 Then elapsed! = elapsed! + 86400 ' must have crossed midnite, add a day
  5.     Locate 1, 1: Print Using "###.##"; elapsed! '      show elapsed time
  6. Loop Until Len(InKey$) '                               any key exits loop
  7. System '                                               return to watching cat videos
  8.  

43
QB64 Discussion / Re: Memory leak (revisited)
« on: September 16, 2021, 07:49:36 pm »
Load &  display an image 10,000 times with no _LIMIT or _DELAY? 
Are you using your CPU to toast bread?

44
QB64 Discussion / Re: Memory leak (revisited)
« on: September 16, 2021, 08:31:55 am »
Screens also count as images. 

My chess program toggles between 480*600 and 800*600, the larger screen
for displaying extra info like pieces captured, history, thinking, etc.

How I *was* doing that, simply SCREEN _NEWIMAGE(scx,scy,32) was creating
a memory leak.  The right way to do it is:

IF mscreen& < -1 THEN
   SCREEN 0
   _FREEIMAGE mscreen&
END IF

mscreen& = _NEWIMAGE(scx,scy,32)
SCREEN mscreen&

The variable mscreen& needs to be in a SUB declared with STATIC, or DIM
SHARED to preserve the value.

45
Programs / Re: Chess
« on: September 12, 2021, 12:54:53 am »
Sep 11, 2021

1) Downsized 2 chess sets, so they load much faster.
2) Lots of small graphics improvements.
3) More, but I forget.  Another price of being uncertain of how often    updates are ok here, when old
    code is never overwritten.



Pages: 1 2 [3] 4 5 ... 22