Comments by Yor Gurt - CodeProject

Yor Gurt 13-Mar-23 21:06pm View

The '5' thing was probably a leftover from me testing :D, I'll clean up my code according to your suggestions. Thanks

Yor Gurt 13-Mar-23 16:47pm View

Thanks, but would you mind telling me what your opinion on the proposed algorithm is? Does it look "logically" correct or does anything here jump out to you as being specifically wrong for solving the problem at hand?

Yor Gurt 13-Mar-23 11:51am View

Hi! Yes, my proposed algorithm doesn't work, and I'd like to get advice/help on getting it working, if possible

Yor Gurt 6-Feb-23 10:30am View

Thanks for the tip, I have devised a simple algorithm, that solves for one of the parameters, would you mind giving me some advice on how I can modify it to solve for both a, and b? Regards

Yor Gurt 5-Feb-23 17:21pm View

I have added my attempt at creating the desired algorithm to the question.

Yor Gurt 5-Feb-23 10:34am View

Apologies, but I have not been able to produce relevant code, since I wasn't even able to devise a way of modifying the algorithm at hand to do what is desired. To be completely honest I don't want you (or anyone else) posting complete code samples. I'm just looking for some help on modifying the suggested algorithm to do what I want it to do (see the what I have tried section).

Yor Gurt 24-Jan-23 8:22am View

I'll create a new question, that describes my problem in more detail, I think the current one is getting a bit too complicated for people to understand. I'll leave a link to it in the original question above.

Yor Gurt 23-Jan-23 4:56am View

I’m afraid there seems to have been a slight misunderstanding - when I talk about going 'down' and 'straight' I'm talking about the value of the matrix decreasing or staying the same from cell-to-cell. (meaning that I'm not looking for anything related to the direction of the path, but for a path, that contains as many segments where the value decreases while minimizing the number of segments where the value stays the same (see my explanation in my original question for a better definition)). Sorry about that :D

Yor Gurt 22-Jan-23 11:05am View

Thanks for the amazing example! I've reimplemented it in my language of choice and all works well, but I'm not really sure how to modify the algorithm so that it prefers going down instead of straight (the goal of the algorithm is to find a path that contains the highest amount of 'down' segments and lowest amount of 'straight' segments). I've tried fiddling around with the path direction just like you suggested, but all my attempts ended in vain - do you have any suggestions? Thanks.

Yor Gurt 20-Jan-23 9:20am View

Hello, thanks for replying. Would you mind being a bit more specific or perhaps even sharing some real code (your preferred language :D)? What does 'store' mean exactly in this context? Are you telling me to create a dynamic array, store cells in it, go through steps 1 through 3 and continue until I don't have any elements in it? I think I'm thinking a bit too much about it and I'm getting stuff confused. Thanks

Yor Gurt 20-Jan-23 9:09am View

Hi, thanks for replying! I've tried implementing your algorithm, but I got stuck + I think that this wouldn't work for all cases. See my updated question for more details.

Comments by Yor Gurt (Top 11 by date)