Skip to main content

Friday Quiz maths problem 14 Oct 22



I did spend a little time trying to reason it out and arrive at an answer through logic but soon gave up and resorted to my usual method of 'try all the numbers and count how many fit'.

Using my trusty Minstrel Forth (Jupiter Ace clone) I have written a program to cycle through all 10-digit numbers that use 1,2 and 3  and test / count  the number that qualify (adjacent numbers differ by 1)


It's taking a while. As I write this it seems to be running but it'll take a little while longer before I have an answer. Once it's finished and I know it's working properly I'll write my program below for Forth fans.

[update]

The answer is 64 and this week we do have some working.  



My program did eventually come up with the right answer after a bit of debugging and you can see the pattern referred to. The listing is below, please feel free to type it in, or paste it if you have one of my USB keyboard / serial adaptors

 I love using recursion. Here I've re-used some words that I'd already created for updating the score in a game. If the word detects that the byte has gone above 9 (or in this case above 3) then it resets that byte, decrements the memory address and calls itself.  It doesn't have a check on the number of recursions it makes, but the main program detects when it's finished (there are 11 bytes in the score table, and when the leftmost ticks over, then the program has finished.)

Note that Jupiter Ace Forth allows you to simply call a word from within that word, some flavours don't allow recursion or use the word RECURSE to call the current word.

 

create score_table 0 c, 0 c, 0 c, 0 c, 0 c, 0 c, 0 c, 0 c, 0 c, 0 c, 0 c,
0 variable total

: inc_recursive ( a--a )
dup dup c@ 1 +
swap c! dup c@ 4 =
if
    dup 1 swap c! 1 - inc_recursive
then ;

: inc_score ( -- )
score_table 10 + inc_recursive drop ;

: qualifies ( a--f )
dup c@ swap 1 + c@ - abs 1 = ;

: num_qualify ( --n )
0 10 1
do
    score_table i + qualifies
    if
        1 +
    then
loop ;

: clear ( -- )
11 0 do
    1 score_table i + c!
loop
0 total !
;

: finished ( --f )
score_table c@ 2 =
;

:  print_score ( -- )
11 1
do
    score_table i + c@ .
loop
cr ;


: run
clear
begin
    inc_score num_qualify 9 =
    if
        total @ 1 + total !
        print_score
    then
    finished
until
cr total @ .
;




 

 

 

 

 

Comments

Popular posts from this blog

ZX81 reversible internal 16k upgrade

T his post is an upvote for Tynemouth Software's  ZX81 reversible Internal 16K RAM upgrade . Their instructions are easy enough for even me to follow and don't involve cutting tracks. This is the ZX81 I've had out on display and used whenever I wanted to. It's an issue 1 and was probably a kit judging by some very untidy assembly. It has a ZX8-CCB  composite video mod and an external keyboard fitted. On board it has two 1k x 4-bit chips.  The ZX81 originally came with 1k on board. Thanks to a trick with compressing the display in ram, that was enough to type and run a small program but you soon felt the limitations. Back in the early 80s, the solution was a 16k ram pack which plugged into the back[1] and this is the way I've been using this particular machine. These ram packs are notorious for 'ram pack wobble'. Even if fastened into place, you can still randomly find your work disappearing. This is a very reliable solution using a more modern 32k chip (half

Driving NeoPixels with Z80

I 've long been thinking about a version two   RC2014 LED matrix module . I've had a matrix with a MAX 7219 on a module. It's a nice enhancement. But there's only so much you can do with a single-colour LED array right? Wouldn't it be cool to have RGB LEDs?  At Liverpool MakeFest I saw a wall-sized ping-pong ball NeoPixel display and picked up some NeoPixels with the intention of making one. Possibly driven by my RC2014.  I enjoy learning about protocols and have had some SPI devices working with the RC2014 - bit-banging SPI works really well because it doesn't care about timing. NeoPixels really do care about timing though. From Adafruit's web page about their 8x8  NeoPixel matrix: If there's one thing I want to get across in this blog post, it's don't just accept what you're told . Question everything. Learn about what's going on and find out why you're being told something isn't possible. Get creative with workarounds. I'

Making new ROMs for the Vic20 / Vicky Twenty

M y Vicky Twenty is very nearly complete.  As things stand, the board and every single component is new*. The processor and VIAs are newly-manufactured (W65C02 and W65C22).  Obviously the Vic1 chip isn't manufactured today, but there is 'new old' stock about. I have been able to buy a Vic 1, date code 1987 (which seems very late). It obviously hasn't been in a computer before, passes the acetone test and works. The same goes for two of the ROMs - character and BASIC. But I haven't been able to buy a new-old Kernal ROM (901486-07). I am able to borrow one - all of the boards I have, have this particular ROM socketed. I don't know whether all of this indicates that the Kernal has proved less reliable than the other two. I recently bought a TL866 for another project. Of all the retro-computing hardware things I've had to learn to do, making ROMs has been one of the simplest. So far, everything has been very easy and worked first time.  I'm not sure that it&