Poetic Carousel 3
For the 29th day of NaPoWriMo/NaPoGenMo 2024, Poetic Carousel 3 contains rules and prompts coded in Ruby & Python. This is done by making a comparison between 6 random assortments of the alphabet and only outputting, letters that match.
Poetic Rule
The following rule set for this poem:
['x', 'j', 'p']
[]
['m', 'h', 'p']
[]
['p', 's']
['e', 'b', 'g', 'l']
Poem
Xylophones jumping profusely
Managing hopes perfectly
Persistence, Simply
Excludes Bass, Grabs & Leave
Code
Ruby
timer = use_random_seed Time.now.to_i
grid = ('a'..'z').to_a
grid_shuffled = grid.shuffle(random: Random.new(timer))
grid_final= []
(0..36).each {|i| grid_final.push(grid_shuffled[i]) }
puts grid_final.inspect
for letters in grid_final do
puts letters
end
File.open("E:/Creatuve Code Challenges/Simplify/Simplification.txt", "w+") do |f|
f.puts(grid_final)
end
Python - File Read
import numpy as np
def reading(x):
f = open(x, "r")
arr = f.read().replace("\n", " ")
print(arr)
arr1 = arr.split(" ")
print(arr1)
arr1_fix = arr1.pop()
return arr1
text_1 = reading("E:\Creatuve Code Challenges\Simplify\Simplification5x5.txt")
text_2 = reading("E:\Creatuve Code Challenges\Simplify\Simplification5x5_1.txt")
text_3 = reading("E:\Creatuve Code Challenges\Simplify\Simplification5x5_2.txt")
text_4 = reading("E:\Creatuve Code Challenges\Simplify\Simplification5x5_3.txt")
Python - File Comparison
def charcheck(a,b):
letters = []
i = 0
while i < len(text_1):
if (a[i] == b[i]):
letters.append(a[i])
i += 1
print(letters)
return letters
tx1_a = charcheck(text_1,text_2)
tx1_b = charcheck(text_1,text_3)
tx1_c = charcheck(text_1,text_4)
tx2_a = charcheck(text_2,text_3)
tx2_b = charcheck(text_2,text_4)
tx3_a = charcheck(text_3,text_4)
