Discussion on: The easiest problem you cannot solve.

View post

There is no restriction to call K, right?

K(K)(cat)(dog)()
K(dog)()

Done! Both of these should output dog.

Update: You can actually put anything you want instead of cat. Or complicate it even more with infinite recursive inputs.

K(K)()(dog)()
K(K(K)()(dog))(K)()
K(K(K)(cat)(dog))()()

I assumed the other solution would have been found first.

Congratulations!

Well I updated with other solution.

haha I didn't consider K(dog)() would be within the rules. I have updated to rules to require both dog and cat to appear exactly once ;)

Lol no! You cannot change the rules after I won :P

I'm still giving you credit for both solutions ;)

K(K)()(dog)()
K(K(K)()(dog))(K)()
K(K(K)(cat)(dog))()()

Very creative!

"cat and dog must appear exactly once."

That violates

K(dog)()
K(K)()(dog)()
K(K(K)()(dog))(K)()

I was the first to solve his problem :D
He changed the rules after I posted my solution.
Check the comments.

I added that rule in afterwards. These solutions were valid at the time he posted, so I'll give him credit for the creativity :)

There is no restriction to call K, right?

There is also a solution with a single call to K :)