Ozzypig
|
  |
| Joined: 27 Mar 2008 |
| Total Posts: 4906 |
|
|
| 21 Jun 2012 07:29 AM |
Think of any ROBLOX wiki article you find good (interesting, useful, handy, great for beginners, great for experts, etc).
Go to the wiki... http://wiki.roblox.com/
Find 'em and post the links here. Don't think too hard about what is good or what is bad, just post a link to an article that pleases you. No need to defend your choice; the point of this thread is to compile a list of wiki articles that scripters forum guys like. |
|
|
| Report Abuse |
|
|
Tenal
|
  |
| Joined: 15 May 2011 |
| Total Posts: 18684 |
|
|
| 21 Jun 2012 07:38 AM |
| I personally think that the wiki contains too much tutorials regarding simple stuff such as changing properties for objects, and the lack of consistency is really getting to me. |
|
|
| Report Abuse |
|
|
|
| 21 Jun 2012 07:46 AM |
Could you write a detailed article regarding AI?
☜▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬☜☆☞▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬☞ - Candymaniac, a highly reactive substance. |
|
|
| Report Abuse |
|
|
zars15
|
  |
| Joined: 10 Nov 2008 |
| Total Posts: 9999 |
|
|
| 21 Jun 2012 07:47 AM |
| I can't even do A*... I kind of habve idea that is should make function what will findall possible paths and then messure shortest one, but my brain just freezes there. |
|
|
| Report Abuse |
|
|
|
| 21 Jun 2012 08:02 AM |
Here's a heavily commented A* demo I've made:
http://www.roblox.com/A-item?id=71066974 |
|
|
| Report Abuse |
|
|
Tenal
|
  |
| Joined: 15 May 2011 |
| Total Posts: 18684 |
|
|
| 21 Jun 2012 08:04 AM |
@brandonhare this isnt your diary |
|
|
| Report Abuse |
|
|
|
| 21 Jun 2012 08:06 AM |
| You're doing it wrong. My post was in reply to zars15, not just a random useless fact. |
|
|
| Report Abuse |
|
|
zars15
|
  |
| Joined: 10 Nov 2008 |
| Total Posts: 9999 |
|
|
| 21 Jun 2012 08:06 AM |
He replyed my post, so he wasn't writing diary ._.
That's what happens when you use his own refferance agnst himself. |
|
|
| Report Abuse |
|
|
Tenal
|
  |
| Joined: 15 May 2011 |
| Total Posts: 18684 |
|
|
| 21 Jun 2012 08:37 AM |
| this is still not your diary |
|
|
| Report Abuse |
|
|
zars15
|
  |
| Joined: 10 Nov 2008 |
| Total Posts: 9999 |
|
|
| 21 Jun 2012 08:38 AM |
| @Nope, my post was reply to candy's, but his post was on topic. Problem? :3 |
|
|
| Report Abuse |
|
|
nate890
|
  |
| Joined: 22 Nov 2008 |
| Total Posts: 21686 |
|
|
| 21 Jun 2012 08:49 AM |
| http://wiki.roblox.com/index.php/String_patterns |
|
|
| Report Abuse |
|
|
Tenal
|
  |
| Joined: 15 May 2011 |
| Total Posts: 18684 |
|
|
| 21 Jun 2012 09:15 AM |
| no, i'm talking about brandonhare and the part that he said that he was replying to you |
|
|
| Report Abuse |
|
|
zars15
|
  |
| Joined: 10 Nov 2008 |
| Total Posts: 9999 |
|
|
| 21 Jun 2012 09:16 AM |
| But he helped me out alot, and that's what diarys can't do - They're absoloutly useless. |
|
|
| Report Abuse |
|
|
|
| 21 Jun 2012 09:16 AM |
| You're absolutely correct Tenal, this isn't my diary. Good observation. |
|
|
| Report Abuse |
|
|
SN0X
|
  |
| Joined: 24 Oct 2011 |
| Total Posts: 7277 |
|
|
| 21 Jun 2012 09:31 AM |
z0g.m
well then a fousand of our posts which u troll'd are just observation too
brandonhare this isnt my deary
hahahahaha |
|
|
| Report Abuse |
|
|
MrNicNac
|
  |
| Joined: 29 Aug 2008 |
| Total Posts: 26567 |
|
|
| 21 Jun 2012 09:57 AM |
http://wiki.roblox.com/index.php/In-Depth_Scripting_Guide http://wiki.roblox.com/index.php/Dijkstra_Algorithm http://wiki.roblox.com/index.php/Scope http://wiki.roblox.com/index.php/Circle |
|
|
| Report Abuse |
|
|
nightname
|
  |
| Joined: 10 Jun 2008 |
| Total Posts: 8960 |
|
|
| 21 Jun 2012 10:27 AM |
One of the most in depth guides in the whole of the Roblox wiki. Teaching you none other than everything to do with personal messages.
http://wiki.roblox.com/index.php/Personal_Messages
Made by me. |
|
|
| Report Abuse |
|
|
zars15
|
  |
| Joined: 10 Nov 2008 |
| Total Posts: 9999 |
|
|
| 21 Jun 2012 10:28 AM |
| @night. Am i st00bid, or i still can't find my inbox or how to send messages.... |
|
|
| Report Abuse |
|
|
Legend26
|
  |
| Joined: 08 Sep 2008 |
| Total Posts: 10586 |
|
|
| 21 Jun 2012 11:17 AM |
| Enumeration / RbxScriptSignal |
|
|
| Report Abuse |
|
|
|
| 21 Jun 2012 11:25 AM |
My favourite articles are the ones about objects which aren't in the object browser.
Someone document the plugin instances (Plugin,Toolbar,Button)! |
|
|
| Report Abuse |
|
|
|
| 21 Jun 2012 12:46 PM |
| Could someone make a list of all the wiki pages? I thought I knew the wiki pretty well, and then someone posts like 6 links I've never seen before.. |
|
|
| Report Abuse |
|
|
Varp
|
  |
| Joined: 18 Nov 2009 |
| Total Posts: 5333 |
|
|
| 21 Jun 2012 02:57 PM |
@MrNicNac
The page http://wiki.roblox.com/index.php/Dijkstra_Algorithm is unclear (and is inefficient - I think it would worsen the time complexity of the entire algorithm, which isn't good). It obfuscates exactly what the closed list is for and doesn't give any good overview of what the algorithm does or how it does it. I'd do something like:
Dijkstra's algorithm is an algorithm for finding the shortest path between two nodes in a graph. A "graph" is a structure containing various nodes or points which are connected by edges. Two nodes are said to be adjacent if they are connected by an edge. (Examples could help) A path on a graph is a series of edges. Each edge has an associated cost of traversal. The length of a path is the sum of the cost of traversing each edge that it consists of.
Conceptually, it is similar to the idea of a flood fill; it starts out by looking at the start node, then every node around that one, then any node adjacent to any of those. It continues expanding until it finds its destination. Dijkstra's algorithm operates using two sets of nodes. Firstly, there is the closed list - this is any node that the algorithm has already searched. Any node in the closed list has a known shortest path to the starting node (e.g. nodes adjacent to the start node can travel directly back). Secondly, there is the open list, which is any node adjacent to things in the closed list. There is a known path between the start node and any node in the open list.
Dijkstra's algorithm says that to find the shortest path between points, one should, at each step of the algorithm, perform the following:
1. Find the node with the shortest path in the open list. 2. Add this node to the closed list. 3. Add all nodes adjacent to this to the open list, along with their
And I'm too lazy to write the code. Your sample looks functional, but actually having an open list would probably simplify the code and make it faster. |
|
|
| Report Abuse |
|
|
TheMyrco
|
  |
| Joined: 13 Aug 2011 |
| Total Posts: 15105 |
|
|
| 21 Jun 2012 03:57 PM |
@Tenal: >is really getting to me.
It's coming for you, run, ruuuun! |
|
|
| Report Abuse |
|
|
MrNicNac
|
  |
| Joined: 29 Aug 2008 |
| Total Posts: 26567 |
|
|
| 21 Jun 2012 04:01 PM |
@Varp
It doesn't take but a second to check and see that I had no doing in that page. I simply suggested it. |
|
|
| Report Abuse |
|
|
belial52
|
  |
| Joined: 10 Oct 2009 |
| Total Posts: 8074 |
|
|
| 21 Jun 2012 04:47 PM |
| The two pages about string and mathematical manipulation. |
|
|
| Report Abuse |
|
|