PS this is not a tiny program would be 1 to3 Hours to me
Yea. I could brute force it with conditionals because I don't have any poker-related pattern recognition shortcuts in my brain. One trick could be to add up all the columns and rows individually. A row that equals 5 is a flush. 5 consecutive columns (including wrap-around to account for ace) that equal 1 is a straight. edit - I see that's already been posted by someone else. In any case, I'd probably start off brute force condition checking for each type of hand, and then look for patterns so I could combine the tests as much as possible. There's probably at least one test where recursion could result in some tight code, at the expense of readability and boundary checking and wasted time sorting out the logic and exit conditions.
VB had just come out when I went through my comp sci degree program and my school didn't offer any courses in it. I think they looked at it as a fad and wanted to see if it gained any traction. Too bad. Instead of learning VB I got ADA, massively parallel programming, and a handful of other courses that would have been of value if I'd continued my USAF career in the R&D field, but of very little value now. I guess the parallel programming theory would apply to low level graphics hardware programming, but I don't think most developers dive that deep even with modern GPUs. The largest computer I had time on was a govt supercomputer and I had access to a 100x100 2D array of independently programmable processors for about a total of 1 hr of compute time. The architecture had both shared and isolated memory, and each processing node had a very low latency shared memory register with cross-connected adjacent nodes. I think I used a total of 200 seconds of compute time and never did any optional projects that could have really stretched that computer's capabilities. Back in 1993...