DataMuseum.dk

Presents historical artifacts from the history of:

Rational R1000/400 Tapes

This is an automatic "excavation" of a thematic subset of
artifacts from Datamuseum.dk's BitArchive.

See our Wiki for more about Rational R1000/400 Tapes

Excavated with: AutoArchaeologist - Free & Open Source Software.


top - download
Index: ┃ B T

⟦c882d2816⟧ TextFile

    Length: 1730 (0x6c2)
    Types: TextFile
    Names: »B«

Derivation

└─⟦149519bd4⟧ Bits:30000546 8mm tape, Rational 1000, !projects 93-07-13
    └─ ⟦124ff5788⟧ »DATA« 
        └─⟦this⟧ 
└─⟦a7d1ea751⟧ Bits:30000550 8mm tape, Rational 1000, !users!projects 94_04_11
    └─ ⟦129cab021⟧ »DATA« 
        └─⟦this⟧ 
└─⟦f64eaa120⟧ Bits:30000752 8mm tape, Rational 1000, !projects 93 02 16
    └─ ⟦6f12a12be⟧ »DATA« 
        └─⟦this⟧ 
└─⟦2f6cfab89⟧ Bits:30000547 8mm tape, Rational 1000, !projects 94-01-04
    └─ ⟦d65440be7⟧ »DATA« 
        └─⟦this⟧ 
└─⟦a7d1ea751⟧ Bits:30000550 8mm tape, Rational 1000, !users!projects 94_04_11
    └─ ⟦129cab021⟧ »DATA« 
        └─⟦e24fb53b7⟧ 
            └─⟦this⟧ 

TextFile

with Fact;
with Towers_Of_Hanoi_Frames;
with Towers_Of_Hanoi_Graphic;
with Towers_Of_Hanoi_Rule_Base;
with Towers_Of_Hanoi_Rules_For_Graphic;
with Text_Io;

use Fact;
use Towers_Of_Hanoi_Frames;

procedure Towers_Of_Hanoi_Graphic_Solution is

    Initial_Tower_Size : constant := 10;
    Initial_Priority   : constant := 1;
    Disk_Size          : Natural;
    function Firable_On_Facts return Fact.Collection
        renames Towers_Of_Hanoi_Rule_Base.Rule_Base.Firable_On_Facts;

    function Firable_On_Rule return Towers_Of_Hanoi_Rule_Base.Rule_Base.Rule_Id
        renames Towers_Of_Hanoi_Rule_Base.Rule_Base.Firable_On_Rule;

    package Toh_Rules renames Towers_Of_Hanoi_Rules_For_Graphic;

begin

    Towers.Add ((Location => 1, Disk_Count => Initial_Tower_Size));
    Towers.Add ((Location => 2, Disk_Count => 0));
    Towers.Add ((Location => 3, Disk_Count => 0));

    for I in 1 .. Initial_Tower_Size loop
        Disk_Size := 12 - I;
        Disks.Add ((Tower => 1, Level => I, Size => Disk_Size));
        Towers_Of_Hanoi_Graphic.Print_Disk (1, I, Disk_Size);
    end loop;

    Movements.Add ((From_Tower => 1,
                    To_Tower   => 3,
                    Count      => Initial_Tower_Size,
                    Priority   => Initial_Priority));

    for I in 1 .. 3 loop
        Towers_Of_Hanoi_Graphic.Print_Needle (I, Height => 15);
    end loop;

    delay 1.5;

    loop
        declare
            Result : constant Fact.Collection := Firable_On_Facts;
        begin
            exit when Result = Empty_Collection;
            Toh_Rules.Do_Action (For_Rule => Firable_On_Rule,  
                                 On_Facts => Result);
        end;
    end loop;

end Towers_Of_Hanoi_Graphic_Solution;