Content
You count numbers every day (I think), and most of you know how to count properly, the one next to 1 is 2, and the next is 3, so go on, no matter what number you receive, you can easily know what next number is.
Anyway, the program doesn't know, they are incredibly stupid, if I make a program shaped like 1, it doesn't count to 2 for me. We need to solve that asap.
Task
Write a program shaped 1 that produces a program shaped 2, which chains and produces the next number, until the program failed and produces a number other than it should be.
Shapes
your number should shaped like:
# ### ### # # ### ### ### ### ### ###
# # # # # # # # # # # # # #
# ### ### ### ### ### # ### ### # #
# # # # # # # # # # # # #
# ### ### # ### ### # ### # ###
It can be enlarged, twisted, be longer or shorter, as long as it Resembles the shape:
Acceptable:
##### ###### ### resembles 9
## # # # # #
## # ###### ###
##### # ###
# # #
# # #
#
Not acceptable:
### ##### ### ####
### # # # # # ##
# ### ### ###
# # # #
# # #
Those does NOT resembles 9
Acceptable reshape:
Original shape:
### ####
# # widen # #
### -------> ####
# #
# #
extend ### shorten ###
-------> # # or # #
### ###
# #
#
#
lengthen ###
-------> # #
# #
###
#
#
enlarge line ### #### #### ### ###
-------> ### or # ## or ## # or # # but not # # (this is
# # #### #### ### ### not 9
### ## # ### ### but a 0)
# ## # # ###
#
You can do 1 or more of those actions on the same digit for any amount of units, for example:
#####
# ##
# ##
#####
##
##
##
##
Is Widened, extended, enlarged, and lengthened.
The original number should be obtained if you repeatedly removing one out of two consecutive identical rows or columns.
For digits that contain a hole in it (6, 8, 9, 0), the hole should exist (length, wide does not matter).
For U-shaped holes (2, 3, 4, 5, 6), those should have at least one empty byte that resembles a hole:
### is done by shortening, and then enlarge line.
##
### Acceptable.
##
###
For numbers that have more than one digit, digits should have at least one spacing between them, and they should not be connected in any way:
# ###
# #
# ###
# #
###
In case someone built a super large program, I am limiting first number's (1) byte count to be under 10k.
Rules
- No standard loopholes
- Takes no input and outputs a program.
- You should output in the very same language you used on the previous number.
Scoring
Your score is the highest number you chained until break.
For example, your code failed to generate 21, your score will be 20. In this case, the 20 program could be anything as long as it fits number rules, may also be non-program.
If there is infinity score exist, it counts as an infinity score.
for tie breaker, It would be the lowest total bytes count until the number 1000.
Whoever gets the largest number is the overall winner. (Grand prize)
And also individual winners for each language too. (individual prize)
