Краси голямо благодаря за задачата . Имаш една Загорка от мен :-) Иначе аз съм в БГ , софия - ти в България ли си . не съм дори близо до вас като гледам колко сте навътре в среиозната математика ... все пак , налага се от време на време с някоя задача да се посблъскаме . Мерси отново за съдействието .
10x much krassi
the robot follows the folags and if there's no flag places it and goes back:
yeah krassi , this does it . 10x a lot . marking every move with a flag is actually the way to solve this .well done with the grafics and the code - looks really good. 10x again
Wish you posted code in c++ though ... still can't figure out how to change the direction if the boolean function that checks for flag returns 0 and keep it in a cycle .
Българин съм да.
hi everybody , I've been struggling for some time now with this math problem , I still can't come up with a resolution without assume there's an end on the infinite axis It goes like this :
There are 2 objects placed on random positions on an infinite axis . Let's say they're robots having built-in algorythm alright and they have exactly the same built-in algorythm . They can do the following . Move a step left , Move a step right , place a flag , check for a flag . That's pretty much it .
The goal is - the robots to meet on the axis eventually .
I fugire checking for a flag can mean that the robot can change it's moving direction which is the key for the goal - if for example the right robot finds one of the left's flags while going left and then switch direction to right and find one of it's own flags ... that's so far I have figured it out . Still as I can see there should be restriction for the axis or ... I don't know .