User contributions for Chrkl

Jump to navigation Jump to search
Search for contributionsExpandCollapse
⧼contribs-top⧽
⧼contribs-date⧽
(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)

9 September 2024

8 September 2024

24 January 2024

  • 08:4308:43, 24 January 2024 diff hist +49 m User:Chrkl/Extended gallery →Compilations: ++
  • 08:4208:42, 24 January 2024 diff hist +1,938 N File:VocaDi-Travel,London.jpeg {{Information |Description=A vocabulary display showing different sights and landmarks of London. (A: The Walkie Talkie, B: Tower Bridge, C: Camden Town, D: Cutty Sark, E: London Eye (Millennium Wheel), F: Royal Observatory, G: Borough Market, H: Piccadilly Circus, I: Buckingham Palace (The Mall), J: St James Park, K: King's Cross (St Pancras), L: Trafalgar Square, M: Millennium Bridge, N: The Tower, O: Oxford Street, P: St Paul's Cathedral) |Source= [https://pixabay.com/photos/london-city-un...

4 May 2023

  • 19:1719:17, 4 May 2023 diff hist +60 User:Chrkl/Extended gallery →Tower of Hanoi, step by step minimal solutions
  • 19:1719:17, 4 May 2023 diff hist +401 N File:HaToSbS-5-0-coins.svg == {{int:filedesc}} == {{Information |Description=An illustration of how to play the Tower of Hanoi game using a sheet of paper and some coins. |Source=own drawing |Date=~~~~~ |Author=chris 論 |Permission= |other_versions= }} Category:Hanoi (image set by User:Chrkl) == {{int:license-header}} == {{Copyrighted free use}}
  • 16:3916:39, 4 May 2023 diff hist +72 User:Chrkl/Extended gallery →Tower of Hanoi, step by step minimal solutions
  • 16:3816:38, 4 May 2023 diff hist +482 N File:HaToSbS-64-0-story.svg {{Information |Description=An illustration showing the 64 golden disks of the original story about the w:Tower of Hanoi riddle. Find the entire set in this category. |Source=own drawing |Date=~~~~~ |Author=~~~ |Permission= |other_versions= }} Category:Hanoi (image set by User:Chrkl) == {{int:license-header}} == {{self|Cc-zero}}
  • 08:2508:25, 4 May 2023 diff hist +663 m User:Chrkl/Extended gallery →Tower of Hanoi, step by step minimal solutions: additional descriptions
  • 08:2108:21, 4 May 2023 diff hist +825 N File:HaToSbS-4-15.svg {{Information |Description=A file showing a single stage in the minimal solution algorithm for the w:Tower of Hanoi problem. The numbers in the filename indicate the number of disks used in this problem followed by the ordinal number of the step in the complete solution process while a zero in the second number indicates the starting configuration of that problem. (E.g. file …4-08… being the eighth step towards minimally solving a tower consisting of four disks) Find the entire set in [...
  • 08:2108:21, 4 May 2023 diff hist +825 N File:HaToSbS-4-14.svg {{Information |Description=A file showing a single stage in the minimal solution algorithm for the w:Tower of Hanoi problem. The numbers in the filename indicate the number of disks used in this problem followed by the ordinal number of the step in the complete solution process while a zero in the second number indicates the starting configuration of that problem. (E.g. file …4-08… being the eighth step towards minimally solving a tower consisting of four disks) Find the entire set in [...
  • 08:2108:21, 4 May 2023 diff hist +825 N File:HaToSbS-4-13.svg {{Information |Description=A file showing a single stage in the minimal solution algorithm for the w:Tower of Hanoi problem. The numbers in the filename indicate the number of disks used in this problem followed by the ordinal number of the step in the complete solution process while a zero in the second number indicates the starting configuration of that problem. (E.g. file …4-08… being the eighth step towards minimally solving a tower consisting of four disks) Find the entire set in [...
  • 08:2008:20, 4 May 2023 diff hist +825 N File:HaToSbS-4-12.svg {{Information |Description=A file showing a single stage in the minimal solution algorithm for the w:Tower of Hanoi problem. The numbers in the filename indicate the number of disks used in this problem followed by the ordinal number of the step in the complete solution process while a zero in the second number indicates the starting configuration of that problem. (E.g. file …4-08… being the eighth step towards minimally solving a tower consisting of four disks) Find the entire set in [...
  • 08:1808:18, 4 May 2023 diff hist +825 N File:HaToSbS-4-11.svg {{Information |Description=A file showing a single stage in the minimal solution algorithm for the w:Tower of Hanoi problem. The numbers in the filename indicate the number of disks used in this problem followed by the ordinal number of the step in the complete solution process while a zero in the second number indicates the starting configuration of that problem. (E.g. file …4-08… being the eighth step towards minimally solving a tower consisting of four disks) Find the entire set in [...
  • 08:1808:18, 4 May 2023 diff hist +825 N File:HaToSbS-4-10.svg {{Information |Description=A file showing a single stage in the minimal solution algorithm for the w:Tower of Hanoi problem. The numbers in the filename indicate the number of disks used in this problem followed by the ordinal number of the step in the complete solution process while a zero in the second number indicates the starting configuration of that problem. (E.g. file …4-08… being the eighth step towards minimally solving a tower consisting of four disks) Find the entire set in [...
  • 08:1708:17, 4 May 2023 diff hist +825 N File:HaToSbS-4-09.svg {{Information |Description=A file showing a single stage in the minimal solution algorithm for the w:Tower of Hanoi problem. The numbers in the filename indicate the number of disks used in this problem followed by the ordinal number of the step in the complete solution process while a zero in the second number indicates the starting configuration of that problem. (E.g. file …4-08… being the eighth step towards minimally solving a tower consisting of four disks) Find the entire set in [...
  • 08:1508:15, 4 May 2023 diff hist +825 N File:HaToSbS-4-08.svg {{Information |Description=A file showing a single stage in the minimal solution algorithm for the w:Tower of Hanoi problem. The numbers in the filename indicate the number of disks used in this problem followed by the ordinal number of the step in the complete solution process while a zero in the second number indicates the starting configuration of that problem. (E.g. file …4-08… being the eighth step towards minimally solving a tower consisting of four disks) Find the entire set in [...
  • 08:1408:14, 4 May 2023 diff hist +825 N File:HaToSbS-4-07.svg {{Information |Description=A file showing a single stage in the minimal solution algorithm for the w:Tower of Hanoi problem. The numbers in the filename indicate the number of disks used in this problem followed by the ordinal number of the step in the complete solution process while a zero in the second number indicates the starting configuration of that problem. (E.g. file …4-08… being the eighth step towards minimally solving a tower consisting of four disks) Find the entire set in [...
  • 08:1308:13, 4 May 2023 diff hist +825 N File:HaToSbS-4-06.svg {{Information |Description=A file showing a single stage in the minimal solution algorithm for the w:Tower of Hanoi problem. The numbers in the filename indicate the number of disks used in this problem followed by the ordinal number of the step in the complete solution process while a zero in the second number indicates the starting configuration of that problem. (E.g. file …4-08… being the eighth step towards minimally solving a tower consisting of four disks) Find the entire set in [...
  • 08:1008:10, 4 May 2023 diff hist +825 N File:HaToSbS-4-05.svg {{Information |Description=A file showing a single stage in the minimal solution algorithm for the w:Tower of Hanoi problem. The numbers in the filename indicate the number of disks used in this problem followed by the ordinal number of the step in the complete solution process while a zero in the second number indicates the starting configuration of that problem. (E.g. file …4-08… being the eighth step towards minimally solving a tower consisting of four disks) Find the entire set in [...
  • 08:0908:09, 4 May 2023 diff hist +825 N File:HaToSbS-4-04.svg {{Information |Description=A file showing a single stage in the minimal solution algorithm for the w:Tower of Hanoi problem. The numbers in the filename indicate the number of disks used in this problem followed by the ordinal number of the step in the complete solution process while a zero in the second number indicates the starting configuration of that problem. (E.g. file …4-08… being the eighth step towards minimally solving a tower consisting of four disks) Find the entire set in [...
  • 08:0808:08, 4 May 2023 diff hist +825 N File:HaToSbS-4-03.svg {{Information |Description=A file showing a single stage in the minimal solution algorithm for the w:Tower of Hanoi problem. The numbers in the filename indicate the number of disks used in this problem followed by the ordinal number of the step in the complete solution process while a zero in the second number indicates the starting configuration of that problem. (E.g. file …4-08… being the eighth step towards minimally solving a tower consisting of four disks) Find the entire set in [...
  • 08:0808:08, 4 May 2023 diff hist +825 N File:HaToSbS-4-02.svg {{Information |Description=A file showing a single stage in the minimal solution algorithm for the w:Tower of Hanoi problem. The numbers in the filename indicate the number of disks used in this problem followed by the ordinal number of the step in the complete solution process while a zero in the second number indicates the starting configuration of that problem. (E.g. file …4-08… being the eighth step towards minimally solving a tower consisting of four disks) Find the entire set in [...
  • 08:0608:06, 4 May 2023 diff hist +825 N File:HaToSbS-4-01.svg {{Information |Description=A file showing a single stage in the minimal solution algorithm for the w:Tower of Hanoi problem. The numbers in the filename indicate the number of disks used in this problem followed by the ordinal number of the step in the complete solution process while a zero in the second number indicates the starting configuration of that problem. (E.g. file …4-08… being the eighth step towards minimally solving a tower consisting of four disks) Find the entire set in [...
  • 08:0508:05, 4 May 2023 diff hist +825 N File:HaToSbS-4-00.svg {{Information |Description=A file showing a single stage in the minimal solution algorithm for the w:Tower of Hanoi problem. The numbers in the filename indicate the number of disks used in this problem followed by the ordinal number of the step in the complete solution process while a zero in the second number indicates the starting configuration of that problem. (E.g. file …4-08… being the eighth step towards minimally solving a tower consisting of four disks) Find the entire set in [...
  • 08:0308:03, 4 May 2023 diff hist +825 N File:HaToSbS-3-7.svg {{Information |Description=A file showing a single stage in the minimal solution algorithm for the w:Tower of Hanoi problem. The numbers in the filename indicate the number of disks used in this problem followed by the ordinal number of the step in the complete solution process while a zero in the second number indicates the starting configuration of that problem. (E.g. file …4-08… being the eighth step towards minimally solving a tower consisting of four disks) Find the entire set in [...
  • 08:0208:02, 4 May 2023 diff hist +825 N File:HaToSbS-3-6.svg {{Information |Description=A file showing a single stage in the minimal solution algorithm for the w:Tower of Hanoi problem. The numbers in the filename indicate the number of disks used in this problem followed by the ordinal number of the step in the complete solution process while a zero in the second number indicates the starting configuration of that problem. (E.g. file …4-08… being the eighth step towards minimally solving a tower consisting of four disks) Find the entire set in [...
  • 08:0208:02, 4 May 2023 diff hist +825 N File:HaToSbS-3-5.svg {{Information |Description=A file showing a single stage in the minimal solution algorithm for the w:Tower of Hanoi problem. The numbers in the filename indicate the number of disks used in this problem followed by the ordinal number of the step in the complete solution process while a zero in the second number indicates the starting configuration of that problem. (E.g. file …4-08… being the eighth step towards minimally solving a tower consisting of four disks) Find the entire set in [...
  • 08:0008:00, 4 May 2023 diff hist +825 N File:HaToSbS-3-4.svg {{Information |Description=A file showing a single stage in the minimal solution algorithm for the w:Tower of Hanoi problem. The numbers in the filename indicate the number of disks used in this problem followed by the ordinal number of the step in the complete solution process while a zero in the second number indicates the starting configuration of that problem. (E.g. file …4-08… being the eighth step towards minimally solving a tower consisting of four disks) Find the entire set in [...
  • 07:5907:59, 4 May 2023 diff hist +41 m Category:Hanoi (image set by User:Chrkl) +formatting, wp-link current
  • 07:5607:56, 4 May 2023 diff hist +825 N File:HaToSbS-3-3.svg {{Information |Description=A file showing a single stage in the minimal solution algorithm for the w:Tower of Hanoi problem. The numbers in the filename indicate the number of disks used in this problem followed by the ordinal number of the step in the complete solution process while a zero in the second number indicates the starting configuration of that problem. (E.g. file …4-08… being the eighth step towards minimally solving a tower consisting of four disks) Find the entire set in [...
  • 07:5507:55, 4 May 2023 diff hist +46 m File:HaToSbS-3-1.svg +license
  • 07:5507:55, 4 May 2023 diff hist +825 N File:HaToSbS-3-2.svg {{Information |Description=A file showing a single stage in the minimal solution algorithm for the w:Tower of Hanoi problem. The numbers in the filename indicate the number of disks used in this problem followed by the ordinal number of the step in the complete solution process while a zero in the second number indicates the starting configuration of that problem. (E.g. file …4-08… being the eighth step towards minimally solving a tower consisting of four disks) Find the entire set in [...
  • 07:5407:54, 4 May 2023 diff hist +779 N File:HaToSbS-3-1.svg {{Information |Description=A file showing a single stage in the minimal solution algorithm for the w:Tower of Hanoi problem. The numbers in the filename indicate the number of disks used in this problem followed by the ordinal number of the step in the complete solution process while a zero in the second number indicates the starting configuration of that problem. (E.g. file …4-08… being the eighth step towards minimally solving a tower consisting of four disks) Find the entire set in [...
  • 07:5307:53, 4 May 2023 diff hist +736 User:Chrkl/Extended gallery →Computer science diagrams: Hanoi towers (preparatory addition, set not uploaded completely at this stage)
  • 07:4907:49, 4 May 2023 diff hist +825 N File:HaToSbS-3-0.svg {{Information |Description=A file showing a single stage in the minimal solution algorithm for the w:Tower of Hanoi problem. The numbers in the filename indicate the number of disks used in this problem followed by the ordinal number of the step in the complete solution process while a zero in the second number indicates the starting configuration of that problem. (E.g. file …4-08… being the eighth step towards minimally solving a tower consisting of four disks) Find the entire set in [...
(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)
User info
Retrieved from "https://commons.wikimedia.org/wiki/Special:Contributions/Chrkl"