1. # we declare 8 arrays, named a to h, representing each column bottom to top i.e. @a[1] refers to the square a1 and @a[8] refers to a8.

  2. # also, we are *not* using the zero-indexed position.

  3. # the first 33 elements of each column need to " " initially

  4. 

  5. my (	(@a = " " xx 33),

  6. 	(@b = " " xx 33), 

  7. 	(@c = " " xx 33),

  8. 	(@d = " " xx 33),

  9. 	(@e = " " xx 33),

  10. 	(@f = " " xx 33),

  11. 	(@g = " " xx 33),

  12. 	(@h = " " xx 33)

  13. );

  14. 

  15. #the drawing function. we draw from top row to bottom row. (while in chess the lowest row is called '1'!)

  16. # expected output:

  17. #          a   b   c   d   e   f   g   h     

  18. #        +---+---+---+---+---+---+---+---+

  19. #      8 |   |   |   |   |   |   |   |   | 8

  20. #	 +---+---+---+---+---+---+---+---+

  21. #      7 |   |   |   |   |   |   |   |   | 7

  22. #        +---+---+---+---+---+---+---+---+

  23. #      6 |   |   |   |   |   |   |   |   | 6

  24. #	 +---+---+---+---+---+---+---+---+

  25. #      5 |   |   |   |   |   |   |   |   | 5

  26. #        +---+---+---+---+---+---+---+---+

  27. #      4 |   |   |   |   |   |   |   |   | 4

  28. #	 +---+---+---+---+---+---+---+---+

  29. #      3 |   |   |   |   |   |   |   |   | 3

  30. #	 +---+---+---+---+---+---+---+---+

  31. #      2 |   |   |   |   |   |   |   |   | 2

  32. #	 +---+---+---+---+---+---+---+---+

  33. #      1 |   |   |   |   |   |   |   |   | 1

  34. #	 +---+---+---+---+---+---+---+---+

  35. #          a   b   c   d   e   f   g   h

  36. 

  37. 

  38. say "    a   b   c   d   e   f   g   h    ";

  39. for (1..8) {

  40. 	say "  +---+---+---+---+---+---+---+---+";

  41. 	say "9-$_ | @a[9-$_] | @b[9-$_] | @c[9-$_] | @d[9-$_] | @e[9-$_] | @f[9-$_] | @g[9-$_] | @h[9-$_] | 9-$_";

  42. }

  43. say "  +---+---+---+---+---+---+---+---+";

  44. say "    a   b   c   d   e   f   g   h    ";