280 karma · joined November 30, 2012
In the game, some of the elevators are automated, and I wanted to choose an algorithm that best aligned with what players would expect an elevator to do. I ended up going with something close to LOOK, which (as the article states) is mostly what people expect. Except in case of ambiguity, I had it prioritise floors that have been waiting longer, to improve the p90, which is important in the game.
But now, add in these challenges:
- double-deck cabs (where attached cabs cover two floors at once)
- transfer floors between shafts
- express shafts
and the best (or at least, most expected) algorithm becomes much less obvious! I'll leave it as an exercise for the reader to figure out the best one.
Luckily I was in charge of a game, not a real elevator system, so I just had to find a heuristic that was good-enough, and could tweak the rules to let players manually override the elevator's plan if they don't like where it's going. This seems to have satisfied most players.
Could you share a comparison with the other tools out there?
I had a question: how much time do you typically spend on this activity in a day? Do you have tips for how to adjust based on the time you have available?
Q: Given V (the number of vertices), E (the number of edges) and L (a list of the edges) for a connected undirected graph, determine whether the graph is a tree.
----
A: It can be done in O(1) by: return V == E + 1
The number of vertices in a tree is always one more than the number of edges. We also know that the graph is connected, so it has to be a tree.
My hope is that the Linkedin support staff is misinformed in this case, and that the suggestions are really being generated from the other side (email correspondents uploading their contact books on Linkedin, not this particular user.) But I have also noticed suspicious suggestions on Linkedin, and am a little concerned with this support answer, to say the least.
With the task tracking space being as crowded as it is, you will need to start with a (probably small) group of users who are really desperate for your product. Who will be these initial target users, and what make-shift solutions have you seen them use right now to satisfy the need for a programmable todo list?
But the trick in Monopoly is to get hotels on your properties as quickly as possible, because this not only provides you with a revenue stream (and fastest return on investment), but also takes money away from your competitors, who would have used it to buy/upgrade their own properties. An important factor is therefore how quickly you can acquire all the streets in a block so you can start putting up hotels, and p * rent of a single street is only one part of that equation.
I didn't mention in the post, but I also checked the scores of all the (public) Gopher Gala entries. Here are the top-rated Gopher Gala projects of the past weekend by quality rating:
1. color 100% https://github.com/gophergala/color
2. gorgonzola 100% https://github.com/gophergala/gorgonzola
3. jsonup 99% https://github.com/gophergala/jsonup
4. goloso 99% https://github.com/gophergala/goloso
5. json-ipsum 99% https://github.com/gophergala/json-ipsum
6. catarang 99% https://github.com/gophergala/catarang
7. xtend-poc 99% https://github.com/gophergala/xtend-poc
8. TypingGeeks 99% https://github.com/gophergala/TypingGeeks
9. HitGoPher 98% https://github.com/gophergala/HitGoPher
10. blinky_light_display 98% https://github.com/gophergala/blinky_light_display
11. lirix 98% https://github.com/gophergala/lirix
12. wisdom 97% https://github.com/gophergala/wisdom
13. rehook 97% https://github.com/gophergala/rehook
14. yps 97% https://github.com/gophergala/yps
15. application-framework 96% https://github.com/gophergala/application-framework
16. fsntor 96% https://github.com/gophergala/fsntor
17. dnsp 90% https://github.com/gophergala/dnsp
18. scpm 87% https://github.com/gophergala/scpm
19. sqldump 87% https://github.com/gophergala/sqldump
20. watchtower 86% https://github.com/gophergala/watchtower
Yes, Go Report Card failed to make the list - we'll have to fix that later :)